./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:26:58,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:26:58,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:26:58,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:26:58,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:26:58,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:26:58,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:26:58,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:26:58,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:26:58,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:26:58,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:26:58,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:26:58,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:26:58,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:26:58,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:26:58,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:26:58,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:26:58,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:26:58,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:26:58,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:26:58,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:26:58,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:26:58,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:26:58,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:26:58,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:26:58,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:26:58,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:26:58,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:26:58,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:26:58,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:26:58,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:26:58,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:26:58,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:26:58,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:26:58,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:26:58,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:26:58,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:26:58,955 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:26:58,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:26:58,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:26:58,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:26:58,958 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 12:26:58,995 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:26:58,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:26:58,996 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:26:58,996 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:26:58,997 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:26:58,998 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:26:58,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:26:58,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:26:58,999 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:26:58,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:26:59,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:26:59,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:26:59,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:26:59,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:26:59,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:26:59,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:26:59,002 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:26:59,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:26:59,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:26:59,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:26:59,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:26:59,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:26:59,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:26:59,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:26:59,004 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:26:59,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:26:59,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:26:59,005 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:26:59,005 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:26:59,005 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:26:59,007 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b [2022-11-16 12:26:59,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:26:59,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:26:59,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:26:59,326 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:26:59,327 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:26:59,328 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-16 12:26:59,403 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/data/f2e4f4785/fb8b8baf245349c6831ad60f0630f36f/FLAG02843c7dc [2022-11-16 12:27:00,063 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:27:00,064 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-16 12:27:00,095 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/data/f2e4f4785/fb8b8baf245349c6831ad60f0630f36f/FLAG02843c7dc [2022-11-16 12:27:00,404 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/data/f2e4f4785/fb8b8baf245349c6831ad60f0630f36f [2022-11-16 12:27:00,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:27:00,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:27:00,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:27:00,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:27:00,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:27:00,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:27:00" (1/1) ... [2022-11-16 12:27:00,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9964e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:00, skipping insertion in model container [2022-11-16 12:27:00,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:27:00" (1/1) ... [2022-11-16 12:27:00,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:27:00,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:27:01,377 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-11-16 12:27:01,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:27:01,435 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:27:01,621 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-11-16 12:27:01,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:27:01,676 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:27:01,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01 WrapperNode [2022-11-16 12:27:01,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:27:01,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:27:01,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:27:01,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:27:01,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2022-11-16 12:27:01,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2022-11-16 12:27:01,820 INFO L138 Inliner]: procedures = 109, calls = 318, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 777 [2022-11-16 12:27:01,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:27:01,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:27:01,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:27:01,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:27:01,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2022-11-16 12:27:01,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2022-11-16 12:27:01,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2022-11-16 12:27:01,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2022-11-16 12:27:01,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2022-11-16 12:27:01,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2022-11-16 12:27:01,911 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2022-11-16 12:27:01,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2022-11-16 12:27:01,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:27:01,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:27:01,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:27:01,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:27:01,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2022-11-16 12:27:01,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:27:01,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:27:01,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:27:02,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:27:02,045 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-16 12:27:02,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-16 12:27:02,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:27:02,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-16 12:27:02,045 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-16 12:27:02,045 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-16 12:27:02,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-16 12:27:02,046 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-16 12:27:02,046 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-16 12:27:02,046 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-11-16 12:27:02,046 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-11-16 12:27:02,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:27:02,047 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-16 12:27:02,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-16 12:27:02,047 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-16 12:27:02,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-16 12:27:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-11-16 12:27:02,048 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-11-16 12:27:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-16 12:27:02,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-16 12:27:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-16 12:27:02,048 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-16 12:27:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:27:02,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:27:02,049 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-16 12:27:02,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-16 12:27:02,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:27:02,049 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-16 12:27:02,050 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-16 12:27:02,050 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-16 12:27:02,050 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-16 12:27:02,050 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-11-16 12:27:02,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-11-16 12:27:02,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:27:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:27:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:27:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-16 12:27:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-16 12:27:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-16 12:27:02,052 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-16 12:27:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:27:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:27:02,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:27:02,417 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:27:02,419 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:27:02,550 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-16 12:27:03,313 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:27:03,322 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:27:03,322 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:27:03,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:03 BoogieIcfgContainer [2022-11-16 12:27:03,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:27:03,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:27:03,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:27:03,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:27:03,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:27:00" (1/3) ... [2022-11-16 12:27:03,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa247e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:27:03, skipping insertion in model container [2022-11-16 12:27:03,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (2/3) ... [2022-11-16 12:27:03,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa247e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:27:03, skipping insertion in model container [2022-11-16 12:27:03,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:03" (3/3) ... [2022-11-16 12:27:03,334 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-16 12:27:03,352 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:27:03,352 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:27:03,440 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:27:03,459 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@15cdb817, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:27:03,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:27:03,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 231 states, 171 states have (on average 1.3157894736842106) internal successors, (225), 182 states have internal predecessors, (225), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-11-16 12:27:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 12:27:03,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:03,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:03,483 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:03,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:03,496 INFO L85 PathProgramCache]: Analyzing trace with hash 73926003, now seen corresponding path program 1 times [2022-11-16 12:27:03,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:03,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966235969] [2022-11-16 12:27:03,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:03,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:03,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:03,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:04,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:27:04,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:04,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966235969] [2022-11-16 12:27:04,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966235969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:04,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:04,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:27:04,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116548996] [2022-11-16 12:27:04,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:04,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:27:04,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:04,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:27:04,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:27:04,075 INFO L87 Difference]: Start difference. First operand has 231 states, 171 states have (on average 1.3157894736842106) internal successors, (225), 182 states have internal predecessors, (225), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:27:04,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:04,683 INFO L93 Difference]: Finished difference Result 464 states and 632 transitions. [2022-11-16 12:27:04,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:27:04,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-11-16 12:27:04,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:04,697 INFO L225 Difference]: With dead ends: 464 [2022-11-16 12:27:04,697 INFO L226 Difference]: Without dead ends: 227 [2022-11-16 12:27:04,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:27:04,705 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 52 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:04,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 564 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:27:04,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-11-16 12:27:04,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 220. [2022-11-16 12:27:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 166 states have (on average 1.283132530120482) internal successors, (213), 171 states have internal predecessors, (213), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-16 12:27:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 287 transitions. [2022-11-16 12:27:04,763 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 287 transitions. Word has length 32 [2022-11-16 12:27:04,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:04,764 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 287 transitions. [2022-11-16 12:27:04,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:27:04,764 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 287 transitions. [2022-11-16 12:27:04,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 12:27:04,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:04,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:04,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:27:04,766 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:04,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:04,767 INFO L85 PathProgramCache]: Analyzing trace with hash 496627829, now seen corresponding path program 1 times [2022-11-16 12:27:04,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:04,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527432377] [2022-11-16 12:27:04,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:04,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:04,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:04,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:05,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:27:05,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:05,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527432377] [2022-11-16 12:27:05,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527432377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:05,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:05,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:27:05,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364165918] [2022-11-16 12:27:05,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:05,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:27:05,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:05,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:27:05,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:27:05,021 INFO L87 Difference]: Start difference. First operand 220 states and 287 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:27:06,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:06,012 INFO L93 Difference]: Finished difference Result 640 states and 844 transitions. [2022-11-16 12:27:06,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:27:06,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-11-16 12:27:06,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:06,017 INFO L225 Difference]: With dead ends: 640 [2022-11-16 12:27:06,017 INFO L226 Difference]: Without dead ends: 425 [2022-11-16 12:27:06,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:27:06,019 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 319 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:06,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 754 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:27:06,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-11-16 12:27:06,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 411. [2022-11-16 12:27:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 310 states have (on average 1.2774193548387096) internal successors, (396), 317 states have internal predecessors, (396), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-11-16 12:27:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 536 transitions. [2022-11-16 12:27:06,058 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 536 transitions. Word has length 32 [2022-11-16 12:27:06,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:06,058 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 536 transitions. [2022-11-16 12:27:06,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:27:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 536 transitions. [2022-11-16 12:27:06,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 12:27:06,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:06,060 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:06,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:27:06,061 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:06,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:06,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1616459438, now seen corresponding path program 1 times [2022-11-16 12:27:06,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:06,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889536659] [2022-11-16 12:27:06,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:06,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:06,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:06,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:06,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:06,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:06,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:06,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:27:06,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:06,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889536659] [2022-11-16 12:27:06,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889536659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:06,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:06,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:27:06,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206096037] [2022-11-16 12:27:06,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:06,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:27:06,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:06,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:27:06,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:27:06,271 INFO L87 Difference]: Start difference. First operand 411 states and 536 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-16 12:27:07,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:07,208 INFO L93 Difference]: Finished difference Result 970 states and 1306 transitions. [2022-11-16 12:27:07,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:27:07,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-11-16 12:27:07,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:07,212 INFO L225 Difference]: With dead ends: 970 [2022-11-16 12:27:07,212 INFO L226 Difference]: Without dead ends: 574 [2022-11-16 12:27:07,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:27:07,215 INFO L413 NwaCegarLoop]: 395 mSDtfsCounter, 611 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:07,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1424 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 12:27:07,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-11-16 12:27:07,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 414. [2022-11-16 12:27:07,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 313 states have (on average 1.2715654952076678) internal successors, (398), 320 states have internal predecessors, (398), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-11-16 12:27:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 538 transitions. [2022-11-16 12:27:07,257 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 538 transitions. Word has length 55 [2022-11-16 12:27:07,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:07,258 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 538 transitions. [2022-11-16 12:27:07,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-16 12:27:07,259 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 538 transitions. [2022-11-16 12:27:07,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 12:27:07,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:07,264 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:07,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:27:07,264 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:07,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:07,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1941191186, now seen corresponding path program 1 times [2022-11-16 12:27:07,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:07,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98433219] [2022-11-16 12:27:07,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:07,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:07,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:07,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:07,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:07,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:07,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:07,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:27:07,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:07,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98433219] [2022-11-16 12:27:07,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98433219] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:07,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:07,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:27:07,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57622566] [2022-11-16 12:27:07,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:07,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:27:07,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:07,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:27:07,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:27:07,421 INFO L87 Difference]: Start difference. First operand 414 states and 538 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:27:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:08,176 INFO L93 Difference]: Finished difference Result 1233 states and 1623 transitions. [2022-11-16 12:27:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:27:08,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2022-11-16 12:27:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:08,182 INFO L225 Difference]: With dead ends: 1233 [2022-11-16 12:27:08,182 INFO L226 Difference]: Without dead ends: 834 [2022-11-16 12:27:08,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:27:08,185 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 324 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:08,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 781 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:27:08,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-11-16 12:27:08,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 804. [2022-11-16 12:27:08,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 612 states have (on average 1.2663398692810457) internal successors, (775), 623 states have internal predecessors, (775), 137 states have call successors, (137), 55 states have call predecessors, (137), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-16 12:27:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1045 transitions. [2022-11-16 12:27:08,293 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1045 transitions. Word has length 55 [2022-11-16 12:27:08,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:08,294 INFO L495 AbstractCegarLoop]: Abstraction has 804 states and 1045 transitions. [2022-11-16 12:27:08,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:27:08,294 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1045 transitions. [2022-11-16 12:27:08,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-16 12:27:08,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:08,296 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:08,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:27:08,297 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:08,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:08,298 INFO L85 PathProgramCache]: Analyzing trace with hash -47375157, now seen corresponding path program 1 times [2022-11-16 12:27:08,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:08,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808464254] [2022-11-16 12:27:08,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:08,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:08,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:08,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:08,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:08,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:08,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:08,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:08,454 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:27:08,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:08,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808464254] [2022-11-16 12:27:08,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808464254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:08,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:08,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:27:08,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577791768] [2022-11-16 12:27:08,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:08,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:27:08,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:08,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:27:08,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:27:08,457 INFO L87 Difference]: Start difference. First operand 804 states and 1045 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:27:08,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:08,928 INFO L93 Difference]: Finished difference Result 834 states and 1094 transitions. [2022-11-16 12:27:08,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:27:08,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2022-11-16 12:27:08,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:08,933 INFO L225 Difference]: With dead ends: 834 [2022-11-16 12:27:08,934 INFO L226 Difference]: Without dead ends: 831 [2022-11-16 12:27:08,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:27:08,935 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 278 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:08,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 528 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:27:08,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-11-16 12:27:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 803. [2022-11-16 12:27:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 612 states have (on average 1.2647058823529411) internal successors, (774), 622 states have internal predecessors, (774), 136 states have call successors, (136), 55 states have call predecessors, (136), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-16 12:27:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1043 transitions. [2022-11-16 12:27:09,025 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1043 transitions. Word has length 56 [2022-11-16 12:27:09,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:09,026 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1043 transitions. [2022-11-16 12:27:09,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:27:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1043 transitions. [2022-11-16 12:27:09,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 12:27:09,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:09,028 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:09,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:27:09,028 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:09,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:09,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1468615535, now seen corresponding path program 1 times [2022-11-16 12:27:09,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:09,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932724481] [2022-11-16 12:27:09,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:09,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:09,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:09,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:09,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:09,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:09,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:09,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:09,178 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:27:09,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:09,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932724481] [2022-11-16 12:27:09,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932724481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:09,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:09,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:27:09,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292250366] [2022-11-16 12:27:09,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:09,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:27:09,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:09,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:27:09,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:27:09,183 INFO L87 Difference]: Start difference. First operand 803 states and 1043 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:27:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:09,631 INFO L93 Difference]: Finished difference Result 833 states and 1092 transitions. [2022-11-16 12:27:09,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:27:09,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-11-16 12:27:09,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:09,639 INFO L225 Difference]: With dead ends: 833 [2022-11-16 12:27:09,640 INFO L226 Difference]: Without dead ends: 830 [2022-11-16 12:27:09,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:27:09,644 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 275 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:09,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 524 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:27:09,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2022-11-16 12:27:09,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 802. [2022-11-16 12:27:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 612 states have (on average 1.2630718954248366) internal successors, (773), 621 states have internal predecessors, (773), 135 states have call successors, (135), 55 states have call predecessors, (135), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-16 12:27:09,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1041 transitions. [2022-11-16 12:27:09,717 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1041 transitions. Word has length 57 [2022-11-16 12:27:09,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:09,718 INFO L495 AbstractCegarLoop]: Abstraction has 802 states and 1041 transitions. [2022-11-16 12:27:09,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:27:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1041 transitions. [2022-11-16 12:27:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 12:27:09,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:09,719 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:09,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:27:09,720 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:09,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:09,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1717577870, now seen corresponding path program 1 times [2022-11-16 12:27:09,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:09,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210135604] [2022-11-16 12:27:09,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:09,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:09,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:09,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:09,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:09,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:09,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:09,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:27:09,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:09,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210135604] [2022-11-16 12:27:09,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210135604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:09,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:09,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:27:09,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053970663] [2022-11-16 12:27:09,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:09,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:27:09,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:09,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:27:09,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:27:09,915 INFO L87 Difference]: Start difference. First operand 802 states and 1041 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:27:10,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:10,313 INFO L93 Difference]: Finished difference Result 832 states and 1090 transitions. [2022-11-16 12:27:10,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:27:10,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-11-16 12:27:10,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:10,317 INFO L225 Difference]: With dead ends: 832 [2022-11-16 12:27:10,318 INFO L226 Difference]: Without dead ends: 821 [2022-11-16 12:27:10,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:27:10,321 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 312 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:10,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 374 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:27:10,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2022-11-16 12:27:10,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 793. [2022-11-16 12:27:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 604 states have (on average 1.2615894039735098) internal successors, (762), 612 states have internal predecessors, (762), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-16 12:27:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1029 transitions. [2022-11-16 12:27:10,382 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1029 transitions. Word has length 58 [2022-11-16 12:27:10,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:10,382 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1029 transitions. [2022-11-16 12:27:10,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:27:10,383 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1029 transitions. [2022-11-16 12:27:10,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-16 12:27:10,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:10,392 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:10,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:27:10,393 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:10,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:10,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1858038329, now seen corresponding path program 1 times [2022-11-16 12:27:10,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:10,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793387316] [2022-11-16 12:27:10,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:10,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-16 12:27:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 12:27:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 12:27:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-16 12:27:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:27:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:27:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-16 12:27:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-16 12:27:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-16 12:27:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:27:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-16 12:27:10,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:10,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793387316] [2022-11-16 12:27:10,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793387316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:10,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:10,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:27:10,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534292178] [2022-11-16 12:27:10,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:10,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:27:10,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:10,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:27:10,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:27:10,728 INFO L87 Difference]: Start difference. First operand 793 states and 1029 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:27:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:11,222 INFO L93 Difference]: Finished difference Result 1663 states and 2177 transitions. [2022-11-16 12:27:11,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:27:11,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 153 [2022-11-16 12:27:11,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:11,227 INFO L225 Difference]: With dead ends: 1663 [2022-11-16 12:27:11,227 INFO L226 Difference]: Without dead ends: 885 [2022-11-16 12:27:11,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:27:11,230 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 191 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:11,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 711 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:27:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-11-16 12:27:11,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 847. [2022-11-16 12:27:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 657 states have (on average 1.2724505327245053) internal successors, (836), 665 states have internal predecessors, (836), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-16 12:27:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1103 transitions. [2022-11-16 12:27:11,294 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1103 transitions. Word has length 153 [2022-11-16 12:27:11,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:11,294 INFO L495 AbstractCegarLoop]: Abstraction has 847 states and 1103 transitions. [2022-11-16 12:27:11,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:27:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1103 transitions. [2022-11-16 12:27:11,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-16 12:27:11,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:11,299 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:11,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:27:11,299 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:11,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:11,300 INFO L85 PathProgramCache]: Analyzing trace with hash -552727768, now seen corresponding path program 1 times [2022-11-16 12:27:11,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:11,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564508581] [2022-11-16 12:27:11,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:11,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:11,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:11,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:11,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:11,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:11,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:11,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:11,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:27:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:11,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-16 12:27:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:11,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-16 12:27:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:11,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:27:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:11,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:11,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 12:27:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:11,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:11,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 12:27:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:11,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 12:27:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:11,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-16 12:27:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:11,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-16 12:27:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-16 12:27:11,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:11,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564508581] [2022-11-16 12:27:11,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564508581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:11,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:11,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:27:11,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114155400] [2022-11-16 12:27:11,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:11,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:27:11,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:11,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:27:11,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:27:11,738 INFO L87 Difference]: Start difference. First operand 847 states and 1103 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:27:12,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:12,399 INFO L93 Difference]: Finished difference Result 2273 states and 3056 transitions. [2022-11-16 12:27:12,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:27:12,400 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 162 [2022-11-16 12:27:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:12,406 INFO L225 Difference]: With dead ends: 2273 [2022-11-16 12:27:12,407 INFO L226 Difference]: Without dead ends: 1445 [2022-11-16 12:27:12,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:27:12,412 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 427 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:12,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1677 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:27:12,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2022-11-16 12:27:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 859. [2022-11-16 12:27:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 669 states have (on average 1.2675635276532138) internal successors, (848), 677 states have internal predecessors, (848), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-16 12:27:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1115 transitions. [2022-11-16 12:27:12,489 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1115 transitions. Word has length 162 [2022-11-16 12:27:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:12,490 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 1115 transitions. [2022-11-16 12:27:12,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:27:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1115 transitions. [2022-11-16 12:27:12,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-16 12:27:12,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:12,496 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:12,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:27:12,496 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:12,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:12,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1711252543, now seen corresponding path program 1 times [2022-11-16 12:27:12,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:12,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177890633] [2022-11-16 12:27:12,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:12,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:12,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:12,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:12,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:12,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:12,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:12,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:12,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:27:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:12,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 12:27:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:12,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:27:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:12,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 12:27:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:12,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:12,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:27:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:12,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:12,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-16 12:27:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:12,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:27:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:12,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 12:27:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:12,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-16 12:27:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-16 12:27:12,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:12,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177890633] [2022-11-16 12:27:12,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177890633] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:27:12,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167232366] [2022-11-16 12:27:12,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:12,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:27:12,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:27:12,967 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:27:12,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:27:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:13,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 1339 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:27:13,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-16 12:27:13,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:27:13,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167232366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:13,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:27:13,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-16 12:27:13,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697317936] [2022-11-16 12:27:13,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:13,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:27:13,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:13,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:27:13,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:27:13,532 INFO L87 Difference]: Start difference. First operand 859 states and 1115 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:27:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:13,913 INFO L93 Difference]: Finished difference Result 2785 states and 3646 transitions. [2022-11-16 12:27:13,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:27:13,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2022-11-16 12:27:13,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:13,924 INFO L225 Difference]: With dead ends: 2785 [2022-11-16 12:27:13,924 INFO L226 Difference]: Without dead ends: 1945 [2022-11-16 12:27:13,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:27:13,928 INFO L413 NwaCegarLoop]: 578 mSDtfsCounter, 393 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:13,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1859 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:27:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2022-11-16 12:27:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 895. [2022-11-16 12:27:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 697 states have (on average 1.2568149210903874) internal successors, (876), 705 states have internal predecessors, (876), 142 states have call successors, (142), 56 states have call predecessors, (142), 55 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-11-16 12:27:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1159 transitions. [2022-11-16 12:27:14,059 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1159 transitions. Word has length 164 [2022-11-16 12:27:14,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:14,059 INFO L495 AbstractCegarLoop]: Abstraction has 895 states and 1159 transitions. [2022-11-16 12:27:14,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:27:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1159 transitions. [2022-11-16 12:27:14,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-16 12:27:14,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:14,064 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:14,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 12:27:14,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:27:14,272 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:14,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:14,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1572597503, now seen corresponding path program 1 times [2022-11-16 12:27:14,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:14,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145839559] [2022-11-16 12:27:14,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:14,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:14,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:14,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:14,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:14,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:14,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:14,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:14,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:27:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:14,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 12:27:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:14,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:27:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:14,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 12:27:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:14,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:14,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:27:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:14,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:14,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-16 12:27:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:14,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:27:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:14,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 12:27:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:14,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-16 12:27:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-16 12:27:15,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:15,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145839559] [2022-11-16 12:27:15,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145839559] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:27:15,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139961456] [2022-11-16 12:27:15,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:15,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:27:15,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:27:15,004 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:27:15,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:27:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:15,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 12:27:15,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-16 12:27:15,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:27:15,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139961456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:15,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:27:15,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-11-16 12:27:15,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638125096] [2022-11-16 12:27:15,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:15,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:27:15,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:15,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:27:15,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:27:15,565 INFO L87 Difference]: Start difference. First operand 895 states and 1159 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:27:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:15,748 INFO L93 Difference]: Finished difference Result 1799 states and 2355 transitions. [2022-11-16 12:27:15,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:27:15,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2022-11-16 12:27:15,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:15,754 INFO L225 Difference]: With dead ends: 1799 [2022-11-16 12:27:15,754 INFO L226 Difference]: Without dead ends: 923 [2022-11-16 12:27:15,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:27:15,757 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 1 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:15,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1104 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:27:15,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-11-16 12:27:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 911. [2022-11-16 12:27:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 709 states have (on average 1.2524682651622003) internal successors, (888), 717 states have internal predecessors, (888), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 145 states have call predecessors, (161), 141 states have call successors, (161) [2022-11-16 12:27:15,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1191 transitions. [2022-11-16 12:27:15,861 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1191 transitions. Word has length 164 [2022-11-16 12:27:15,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:15,861 INFO L495 AbstractCegarLoop]: Abstraction has 911 states and 1191 transitions. [2022-11-16 12:27:15,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:27:15,862 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1191 transitions. [2022-11-16 12:27:15,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-11-16 12:27:15,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:15,866 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:15,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:27:16,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:27:16,074 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:16,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:16,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1692113821, now seen corresponding path program 1 times [2022-11-16 12:27:16,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:16,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680574188] [2022-11-16 12:27:16,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:16,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:16,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:27:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:27:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:27:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-16 12:27:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-16 12:27:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 12:27:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-16 12:27:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 12:27:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-16 12:27:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-16 12:27:17,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:17,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680574188] [2022-11-16 12:27:17,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680574188] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:27:17,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039593384] [2022-11-16 12:27:17,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:17,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:27:17,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:27:17,468 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:27:17,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:27:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:17,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 1360 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 12:27:17,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 33 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-16 12:27:18,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:27:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-16 12:27:18,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039593384] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:27:18,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:27:18,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 20 [2022-11-16 12:27:18,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549098145] [2022-11-16 12:27:18,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:27:18,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 12:27:18,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:18,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 12:27:18,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-11-16 12:27:18,585 INFO L87 Difference]: Start difference. First operand 911 states and 1191 transitions. Second operand has 20 states, 20 states have (on average 6.5) internal successors, (130), 12 states have internal predecessors, (130), 4 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (23), 8 states have call predecessors, (23), 4 states have call successors, (23) [2022-11-16 12:27:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:20,065 INFO L93 Difference]: Finished difference Result 2037 states and 2690 transitions. [2022-11-16 12:27:20,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:27:20,066 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.5) internal successors, (130), 12 states have internal predecessors, (130), 4 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (23), 8 states have call predecessors, (23), 4 states have call successors, (23) Word has length 170 [2022-11-16 12:27:20,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:20,072 INFO L225 Difference]: With dead ends: 2037 [2022-11-16 12:27:20,072 INFO L226 Difference]: Without dead ends: 1145 [2022-11-16 12:27:20,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 364 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-11-16 12:27:20,076 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 201 mSDsluCounter, 2716 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 2994 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:20,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 2994 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-16 12:27:20,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2022-11-16 12:27:20,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 951. [2022-11-16 12:27:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 741 states have (on average 1.2415654520917678) internal successors, (920), 745 states have internal predecessors, (920), 146 states have call successors, (146), 56 states have call predecessors, (146), 63 states have return successors, (177), 157 states have call predecessors, (177), 145 states have call successors, (177) [2022-11-16 12:27:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1243 transitions. [2022-11-16 12:27:20,233 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1243 transitions. Word has length 170 [2022-11-16 12:27:20,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:20,234 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1243 transitions. [2022-11-16 12:27:20,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.5) internal successors, (130), 12 states have internal predecessors, (130), 4 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (23), 8 states have call predecessors, (23), 4 states have call successors, (23) [2022-11-16 12:27:20,234 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1243 transitions. [2022-11-16 12:27:20,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-11-16 12:27:20,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:20,238 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:20,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-16 12:27:20,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 12:27:20,446 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:20,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:20,446 INFO L85 PathProgramCache]: Analyzing trace with hash -507629633, now seen corresponding path program 2 times [2022-11-16 12:27:20,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:20,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492929414] [2022-11-16 12:27:20,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:20,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:27:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:27:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:27:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-16 12:27:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-16 12:27:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-16 12:27:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 12:27:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-16 12:27:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-16 12:27:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-16 12:27:21,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:21,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492929414] [2022-11-16 12:27:21,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492929414] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:27:21,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681376405] [2022-11-16 12:27:21,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:27:21,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:27:21,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:27:21,640 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:27:21,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:27:22,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 12:27:22,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:27:22,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 12:27:22,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-16 12:27:22,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:27:22,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681376405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:22,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:27:22,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2022-11-16 12:27:22,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334320706] [2022-11-16 12:27:22,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:22,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:27:22,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:22,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:27:22,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:27:22,210 INFO L87 Difference]: Start difference. First operand 951 states and 1243 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:27:22,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:22,801 INFO L93 Difference]: Finished difference Result 1931 states and 2619 transitions. [2022-11-16 12:27:22,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:27:22,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 176 [2022-11-16 12:27:22,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:22,810 INFO L225 Difference]: With dead ends: 1931 [2022-11-16 12:27:22,810 INFO L226 Difference]: Without dead ends: 1461 [2022-11-16 12:27:22,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:27:22,814 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 553 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1920 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:22,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1920 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:27:22,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2022-11-16 12:27:22,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 957. [2022-11-16 12:27:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 747 states have (on average 1.2396251673360108) internal successors, (926), 751 states have internal predecessors, (926), 146 states have call successors, (146), 56 states have call predecessors, (146), 63 states have return successors, (177), 157 states have call predecessors, (177), 145 states have call successors, (177) [2022-11-16 12:27:22,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1249 transitions. [2022-11-16 12:27:22,999 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1249 transitions. Word has length 176 [2022-11-16 12:27:22,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:22,999 INFO L495 AbstractCegarLoop]: Abstraction has 957 states and 1249 transitions. [2022-11-16 12:27:22,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:27:23,000 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1249 transitions. [2022-11-16 12:27:23,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-16 12:27:23,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:23,004 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:23,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:27:23,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 12:27:23,212 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:23,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:23,212 INFO L85 PathProgramCache]: Analyzing trace with hash -745303818, now seen corresponding path program 1 times [2022-11-16 12:27:23,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:23,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536973985] [2022-11-16 12:27:23,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:23,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:27:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:27:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:27:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-16 12:27:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-16 12:27:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-16 12:27:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 12:27:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-16 12:27:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-16 12:27:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-16 12:27:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-11-16 12:27:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-11-16 12:27:23,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:23,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536973985] [2022-11-16 12:27:23,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536973985] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:27:23,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298125869] [2022-11-16 12:27:23,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:23,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:27:23,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:27:23,887 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:27:23,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:27:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:24,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 1849 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:27:24,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-11-16 12:27:24,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:27:24,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298125869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:24,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:27:24,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-11-16 12:27:24,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083108083] [2022-11-16 12:27:24,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:24,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:27:24,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:24,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:27:24,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:27:24,758 INFO L87 Difference]: Start difference. First operand 957 states and 1249 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-16 12:27:25,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:25,358 INFO L93 Difference]: Finished difference Result 2835 states and 3710 transitions. [2022-11-16 12:27:25,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:27:25,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 209 [2022-11-16 12:27:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:25,372 INFO L225 Difference]: With dead ends: 2835 [2022-11-16 12:27:25,373 INFO L226 Difference]: Without dead ends: 2827 [2022-11-16 12:27:25,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:27:25,375 INFO L413 NwaCegarLoop]: 571 mSDtfsCounter, 400 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:25,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1037 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:27:25,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2022-11-16 12:27:25,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2813. [2022-11-16 12:27:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2199 states have (on average 1.2432924056389267) internal successors, (2734), 2215 states have internal predecessors, (2734), 430 states have call successors, (430), 160 states have call predecessors, (430), 183 states have return successors, (525), 461 states have call predecessors, (525), 429 states have call successors, (525) [2022-11-16 12:27:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 3689 transitions. [2022-11-16 12:27:25,841 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 3689 transitions. Word has length 209 [2022-11-16 12:27:25,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:25,842 INFO L495 AbstractCegarLoop]: Abstraction has 2813 states and 3689 transitions. [2022-11-16 12:27:25,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-16 12:27:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3689 transitions. [2022-11-16 12:27:25,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-11-16 12:27:25,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:25,849 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:25,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:27:26,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 12:27:26,058 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:26,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:26,059 INFO L85 PathProgramCache]: Analyzing trace with hash -775127726, now seen corresponding path program 1 times [2022-11-16 12:27:26,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:26,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230384314] [2022-11-16 12:27:26,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:26,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:27:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:27:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:27:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-16 12:27:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-16 12:27:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-16 12:27:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 12:27:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-16 12:27:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-16 12:27:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-16 12:27:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-16 12:27:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-16 12:27:26,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:26,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230384314] [2022-11-16 12:27:26,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230384314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:26,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:26,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:27:26,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993769238] [2022-11-16 12:27:26,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:26,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:27:26,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:26,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:27:26,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:27:26,594 INFO L87 Difference]: Start difference. First operand 2813 states and 3689 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-16 12:27:28,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:28,622 INFO L93 Difference]: Finished difference Result 8907 states and 11752 transitions. [2022-11-16 12:27:28,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:27:28,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 203 [2022-11-16 12:27:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:28,656 INFO L225 Difference]: With dead ends: 8907 [2022-11-16 12:27:28,657 INFO L226 Difference]: Without dead ends: 6113 [2022-11-16 12:27:28,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:27:28,669 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 644 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:28,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 1255 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:27:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6113 states. [2022-11-16 12:27:29,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6113 to 2825. [2022-11-16 12:27:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2211 states have (on average 1.2419719583898687) internal successors, (2746), 2231 states have internal predecessors, (2746), 430 states have call successors, (430), 160 states have call predecessors, (430), 183 states have return successors, (525), 457 states have call predecessors, (525), 429 states have call successors, (525) [2022-11-16 12:27:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3701 transitions. [2022-11-16 12:27:29,348 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3701 transitions. Word has length 203 [2022-11-16 12:27:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:29,351 INFO L495 AbstractCegarLoop]: Abstraction has 2825 states and 3701 transitions. [2022-11-16 12:27:29,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-16 12:27:29,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3701 transitions. [2022-11-16 12:27:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-11-16 12:27:29,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:29,359 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:29,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:27:29,360 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:29,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:29,360 INFO L85 PathProgramCache]: Analyzing trace with hash 458266976, now seen corresponding path program 1 times [2022-11-16 12:27:29,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:29,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447312852] [2022-11-16 12:27:29,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:29,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:27:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:27:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:27:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-16 12:27:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-16 12:27:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-16 12:27:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 12:27:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-16 12:27:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-16 12:27:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-16 12:27:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-16 12:27:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-16 12:27:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-16 12:27:30,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:30,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447312852] [2022-11-16 12:27:30,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447312852] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:27:30,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841672410] [2022-11-16 12:27:30,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:30,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:27:30,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:27:30,768 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:27:30,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:27:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:31,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 1837 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-16 12:27:31,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:31,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:27:31,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-16 12:27:32,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:27:32,245 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1049 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1049) |c_#memory_int|)) is different from true [2022-11-16 12:27:32,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:27:32,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:27:32,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:27:32,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:27:32,387 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:27:32,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:27:32,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:27:32,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:27:32,834 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:27:32,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:27:33,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:27:33,830 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:27:33,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:27:34,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:27:35,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:27:35,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:27:35,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:27:35,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:27:35,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:27:35,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-16 12:27:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 36 proven. 53 refuted. 6 times theorem prover too weak. 18 trivial. 2 not checked. [2022-11-16 12:27:35,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:27:35,653 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1061 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1061) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-16 12:27:35,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841672410] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:27:35,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:27:35,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 39] total 50 [2022-11-16 12:27:35,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265921354] [2022-11-16 12:27:35,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:27:35,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-16 12:27:35,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:35,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-16 12:27:35,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2174, Unknown=28, NotChecked=190, Total=2550 [2022-11-16 12:27:35,685 INFO L87 Difference]: Start difference. First operand 2825 states and 3701 transitions. Second operand has 50 states, 47 states have (on average 5.382978723404255) internal successors, (253), 36 states have internal predecessors, (253), 15 states have call successors, (41), 11 states have call predecessors, (41), 15 states have return successors, (41), 18 states have call predecessors, (41), 15 states have call successors, (41) [2022-11-16 12:27:39,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:39,478 INFO L93 Difference]: Finished difference Result 8432 states and 11394 transitions. [2022-11-16 12:27:39,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-16 12:27:39,479 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 5.382978723404255) internal successors, (253), 36 states have internal predecessors, (253), 15 states have call successors, (41), 11 states have call predecessors, (41), 15 states have return successors, (41), 18 states have call predecessors, (41), 15 states have call successors, (41) Word has length 210 [2022-11-16 12:27:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:39,538 INFO L225 Difference]: With dead ends: 8432 [2022-11-16 12:27:39,538 INFO L226 Difference]: Without dead ends: 5626 [2022-11-16 12:27:39,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 261 SyntacticMatches, 15 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=326, Invalid=5189, Unknown=43, NotChecked=294, Total=5852 [2022-11-16 12:27:39,549 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 792 mSDsluCounter, 11226 mSDsCounter, 0 mSdLazyCounter, 1786 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 11737 SdHoareTripleChecker+Invalid, 4652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2794 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:39,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 11737 Invalid, 4652 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [72 Valid, 1786 Invalid, 0 Unknown, 2794 Unchecked, 1.6s Time] [2022-11-16 12:27:39,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5626 states. [2022-11-16 12:27:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5626 to 3035. [2022-11-16 12:27:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3035 states, 2388 states have (on average 1.246649916247906) internal successors, (2977), 2412 states have internal predecessors, (2977), 445 states have call successors, (445), 174 states have call predecessors, (445), 201 states have return successors, (548), 472 states have call predecessors, (548), 444 states have call successors, (548) [2022-11-16 12:27:40,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 3970 transitions. [2022-11-16 12:27:40,235 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 3970 transitions. Word has length 210 [2022-11-16 12:27:40,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:40,236 INFO L495 AbstractCegarLoop]: Abstraction has 3035 states and 3970 transitions. [2022-11-16 12:27:40,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 5.382978723404255) internal successors, (253), 36 states have internal predecessors, (253), 15 states have call successors, (41), 11 states have call predecessors, (41), 15 states have return successors, (41), 18 states have call predecessors, (41), 15 states have call successors, (41) [2022-11-16 12:27:40,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 3970 transitions. [2022-11-16 12:27:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-11-16 12:27:40,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:40,246 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:40,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:27:40,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:27:40,455 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:40,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:40,456 INFO L85 PathProgramCache]: Analyzing trace with hash 930140222, now seen corresponding path program 2 times [2022-11-16 12:27:40,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:40,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215059145] [2022-11-16 12:27:40,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:40,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:27:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:27:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:27:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-16 12:27:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-16 12:27:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-16 12:27:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 12:27:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-16 12:27:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-16 12:27:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-16 12:27:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-11-16 12:27:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-11-16 12:27:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-11-16 12:27:41,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:41,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215059145] [2022-11-16 12:27:41,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215059145] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:27:41,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431592585] [2022-11-16 12:27:41,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:27:41,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:27:41,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:27:41,952 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:27:41,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:27:42,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:27:42,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:27:42,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 1863 conjuncts, 164 conjunts are in the unsatisfiable core [2022-11-16 12:27:42,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:42,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:27:42,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-16 12:27:43,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:27:43,057 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1346 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1346) |c_#memory_int|)) is different from true [2022-11-16 12:27:43,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:27:43,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:27:43,257 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:27:43,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 19 [2022-11-16 12:27:43,284 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:27:43,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:27:43,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:27:43,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:27:43,806 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:27:43,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:27:44,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:27:44,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:27:45,237 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-16 12:27:45,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-16 12:27:45,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 12:27:46,030 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-16 12:27:46,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-11-16 12:27:46,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:27:46,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:27:46,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:27:47,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:27:47,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:27:47,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:27:47,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-16 12:27:47,144 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 42 proven. 68 refuted. 0 times theorem prover too weak. 23 trivial. 2 not checked. [2022-11-16 12:27:47,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:27:47,268 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1357 (Array Int Int)) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1357) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-16 12:27:47,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431592585] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:27:47,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:27:47,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 50] total 57 [2022-11-16 12:27:47,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53719213] [2022-11-16 12:27:47,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:27:47,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-16 12:27:47,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:47,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-16 12:27:47,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=3054, Unknown=3, NotChecked=226, Total=3540 [2022-11-16 12:27:47,300 INFO L87 Difference]: Start difference. First operand 3035 states and 3970 transitions. Second operand has 57 states, 53 states have (on average 4.69811320754717) internal successors, (249), 41 states have internal predecessors, (249), 15 states have call successors, (40), 13 states have call predecessors, (40), 15 states have return successors, (40), 19 states have call predecessors, (40), 15 states have call successors, (40) [2022-11-16 12:27:50,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:50,799 INFO L93 Difference]: Finished difference Result 8055 states and 10824 transitions. [2022-11-16 12:27:50,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-16 12:27:50,800 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 53 states have (on average 4.69811320754717) internal successors, (249), 41 states have internal predecessors, (249), 15 states have call successors, (40), 13 states have call predecessors, (40), 15 states have return successors, (40), 19 states have call predecessors, (40), 15 states have call successors, (40) Word has length 216 [2022-11-16 12:27:50,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:50,819 INFO L225 Difference]: With dead ends: 8055 [2022-11-16 12:27:50,820 INFO L226 Difference]: Without dead ends: 5225 [2022-11-16 12:27:50,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 254 SyntacticMatches, 15 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2229 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=441, Invalid=5724, Unknown=5, NotChecked=310, Total=6480 [2022-11-16 12:27:50,830 INFO L413 NwaCegarLoop]: 472 mSDtfsCounter, 766 mSDsluCounter, 8541 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 9013 SdHoareTripleChecker+Invalid, 3679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2354 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:50,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 9013 Invalid, 3679 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [192 Valid, 1133 Invalid, 0 Unknown, 2354 Unchecked, 1.3s Time] [2022-11-16 12:27:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2022-11-16 12:27:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 3234. [2022-11-16 12:27:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 2565 states have (on average 1.2444444444444445) internal successors, (3192), 2579 states have internal predecessors, (3192), 457 states have call successors, (457), 182 states have call predecessors, (457), 211 states have return successors, (566), 496 states have call predecessors, (566), 456 states have call successors, (566) [2022-11-16 12:27:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 4215 transitions. [2022-11-16 12:27:51,560 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 4215 transitions. Word has length 216 [2022-11-16 12:27:51,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:51,560 INFO L495 AbstractCegarLoop]: Abstraction has 3234 states and 4215 transitions. [2022-11-16 12:27:51,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 53 states have (on average 4.69811320754717) internal successors, (249), 41 states have internal predecessors, (249), 15 states have call successors, (40), 13 states have call predecessors, (40), 15 states have return successors, (40), 19 states have call predecessors, (40), 15 states have call successors, (40) [2022-11-16 12:27:51,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 4215 transitions. [2022-11-16 12:27:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-11-16 12:27:51,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:51,570 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:51,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:27:51,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:27:51,780 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:51,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:51,781 INFO L85 PathProgramCache]: Analyzing trace with hash 218861600, now seen corresponding path program 1 times [2022-11-16 12:27:51,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:51,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233494683] [2022-11-16 12:27:51,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:27:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:27:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:27:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-16 12:27:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-16 12:27:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-16 12:27:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-16 12:27:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-16 12:27:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-16 12:27:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-16 12:27:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-16 12:27:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-16 12:27:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-11-16 12:27:52,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:52,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233494683] [2022-11-16 12:27:52,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233494683] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:27:52,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350282116] [2022-11-16 12:27:52,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:52,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:27:52,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:27:52,889 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:27:52,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:27:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:53,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 1888 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-16 12:27:53,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:53,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:27:53,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-16 12:27:54,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:27:54,023 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1650 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1650) |c_#memory_int|)) is different from true [2022-11-16 12:27:54,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:27:54,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:27:54,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:27:54,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:27:54,161 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:27:54,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:27:54,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:27:54,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:27:54,481 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:27:54,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:27:54,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:27:54,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:27:55,443 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:27:55,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:27:55,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:27:56,036 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 12:27:56,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:27:56,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:27:56,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:27:56,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:27:56,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:27:56,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:27:56,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:27:56,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-16 12:27:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 52 proven. 69 refuted. 10 times theorem prover too weak. 28 trivial. 2 not checked. [2022-11-16 12:27:56,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:27:56,858 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1662 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1662) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-16 12:27:56,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350282116] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:27:56,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:27:56,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 41] total 48 [2022-11-16 12:27:56,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701943080] [2022-11-16 12:27:56,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:27:56,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-16 12:27:56,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:56,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-16 12:27:56,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1949, Unknown=25, NotChecked=182, Total=2352 [2022-11-16 12:27:56,885 INFO L87 Difference]: Start difference. First operand 3234 states and 4215 transitions. Second operand has 48 states, 45 states have (on average 5.644444444444445) internal successors, (254), 35 states have internal predecessors, (254), 16 states have call successors, (42), 12 states have call predecessors, (42), 15 states have return successors, (42), 19 states have call predecessors, (42), 16 states have call successors, (42) [2022-11-16 12:28:00,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:28:00,593 INFO L93 Difference]: Finished difference Result 8406 states and 11485 transitions. [2022-11-16 12:28:00,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-16 12:28:00,594 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 5.644444444444445) internal successors, (254), 35 states have internal predecessors, (254), 16 states have call successors, (42), 12 states have call predecessors, (42), 15 states have return successors, (42), 19 states have call predecessors, (42), 16 states have call successors, (42) Word has length 222 [2022-11-16 12:28:00,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:28:00,624 INFO L225 Difference]: With dead ends: 8406 [2022-11-16 12:28:00,624 INFO L226 Difference]: Without dead ends: 6926 [2022-11-16 12:28:00,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 274 SyntacticMatches, 16 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1697 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=354, Invalid=4175, Unknown=35, NotChecked=266, Total=4830 [2022-11-16 12:28:00,633 INFO L413 NwaCegarLoop]: 525 mSDtfsCounter, 876 mSDsluCounter, 6204 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 6729 SdHoareTripleChecker+Invalid, 3218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1804 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:28:00,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 6729 Invalid, 3218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1203 Invalid, 0 Unknown, 1804 Unchecked, 1.6s Time] [2022-11-16 12:28:00,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6926 states. [2022-11-16 12:28:01,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6926 to 3396. [2022-11-16 12:28:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3396 states, 2693 states have (on average 1.2387671741552173) internal successors, (3336), 2697 states have internal predecessors, (3336), 475 states have call successors, (475), 194 states have call predecessors, (475), 227 states have return successors, (594), 528 states have call predecessors, (594), 474 states have call successors, (594) [2022-11-16 12:28:01,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 4405 transitions. [2022-11-16 12:28:01,481 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 4405 transitions. Word has length 222 [2022-11-16 12:28:01,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:28:01,482 INFO L495 AbstractCegarLoop]: Abstraction has 3396 states and 4405 transitions. [2022-11-16 12:28:01,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 5.644444444444445) internal successors, (254), 35 states have internal predecessors, (254), 16 states have call successors, (42), 12 states have call predecessors, (42), 15 states have return successors, (42), 19 states have call predecessors, (42), 16 states have call successors, (42) [2022-11-16 12:28:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 4405 transitions. [2022-11-16 12:28:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-11-16 12:28:01,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:28:01,494 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:28:01,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:28:01,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 12:28:01,705 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:28:01,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:28:01,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1412937121, now seen corresponding path program 1 times [2022-11-16 12:28:01,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:28:01,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789890034] [2022-11-16 12:28:01,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:28:01,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:28:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:28:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:28:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:28:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:28:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:28:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:28:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-16 12:28:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 12:28:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-16 12:28:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-16 12:28:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-16 12:28:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-16 12:28:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-16 12:28:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-16 12:28:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-11-16 12:28:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-16 12:28:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,755 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-11-16 12:28:02,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:28:02,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789890034] [2022-11-16 12:28:02,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789890034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:28:02,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:28:02,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:28:02,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147451442] [2022-11-16 12:28:02,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:28:02,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:28:02,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:28:02,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:28:02,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:28:02,763 INFO L87 Difference]: Start difference. First operand 3396 states and 4405 transitions. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-16 12:28:03,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:28:03,960 INFO L93 Difference]: Finished difference Result 6322 states and 8201 transitions. [2022-11-16 12:28:03,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:28:03,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 232 [2022-11-16 12:28:03,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:28:03,975 INFO L225 Difference]: With dead ends: 6322 [2022-11-16 12:28:03,975 INFO L226 Difference]: Without dead ends: 3396 [2022-11-16 12:28:03,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:28:03,985 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 95 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:28:03,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1093 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:28:03,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2022-11-16 12:28:04,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 3396. [2022-11-16 12:28:04,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3396 states, 2693 states have (on average 1.2387671741552173) internal successors, (3336), 2697 states have internal predecessors, (3336), 475 states have call successors, (475), 194 states have call predecessors, (475), 227 states have return successors, (582), 528 states have call predecessors, (582), 474 states have call successors, (582) [2022-11-16 12:28:04,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 4393 transitions. [2022-11-16 12:28:04,743 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 4393 transitions. Word has length 232 [2022-11-16 12:28:04,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:28:04,744 INFO L495 AbstractCegarLoop]: Abstraction has 3396 states and 4393 transitions. [2022-11-16 12:28:04,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-16 12:28:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 4393 transitions. [2022-11-16 12:28:04,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-11-16 12:28:04,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:28:04,757 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:28:04,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 12:28:04,757 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:28:04,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:28:04,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1569901697, now seen corresponding path program 1 times [2022-11-16 12:28:04,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:28:04,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127186057] [2022-11-16 12:28:04,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:28:04,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:28:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:10,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:10,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:10,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:28:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:10,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:28:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:11,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:11,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:28:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:11,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:28:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:11,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:11,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:28:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:11,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:28:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:11,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-16 12:28:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:11,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 12:28:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:12,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:12,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:12,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-16 12:28:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:12,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:12,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:12,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-16 12:28:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:12,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:12,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-16 12:28:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:12,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:12,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-16 12:28:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:12,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-16 12:28:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:12,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:12,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-16 12:28:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:12,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-16 12:28:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:12,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-11-16 12:28:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:12,914 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 7 proven. 72 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-16 12:28:12,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:28:12,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127186057] [2022-11-16 12:28:12,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127186057] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:28:12,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795563474] [2022-11-16 12:28:12,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:28:12,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:28:12,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:28:12,917 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:28:12,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:28:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:13,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 1956 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-16 12:28:13,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:28:13,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:28:13,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-16 12:28:14,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2022-11-16 12:28:14,481 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2124 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2124))) is different from true [2022-11-16 12:28:14,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:28:14,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2022-11-16 12:28:14,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:28:14,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:28:14,723 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-16 12:28:14,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2022-11-16 12:28:14,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:28:15,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:28:15,238 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:28:15,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:28:16,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:28:16,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:28:16,835 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:28:16,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:28:17,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:28:17,917 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:28:17,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:28:18,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:28:18,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:28:18,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:28:19,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:28:19,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:28:19,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:28:19,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-16 12:28:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 90 proven. 65 refuted. 16 times theorem prover too weak. 58 trivial. 2 not checked. [2022-11-16 12:28:19,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:28:21,187 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_2136 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2136) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-16 12:28:21,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2136 (Array Int Int)) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2136) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-16 12:28:21,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795563474] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:28:21,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:28:21,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 40] total 76 [2022-11-16 12:28:21,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827177244] [2022-11-16 12:28:21,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:28:21,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-11-16 12:28:21,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:28:21,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-11-16 12:28:21,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=5237, Unknown=32, NotChecked=444, Total=6006 [2022-11-16 12:28:21,219 INFO L87 Difference]: Start difference. First operand 3396 states and 4393 transitions. Second operand has 76 states, 71 states have (on average 3.816901408450704) internal successors, (271), 59 states have internal predecessors, (271), 27 states have call successors, (49), 11 states have call predecessors, (49), 21 states have return successors, (50), 32 states have call predecessors, (50), 27 states have call successors, (50) [2022-11-16 12:28:29,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:28:29,178 INFO L93 Difference]: Finished difference Result 7540 states and 9865 transitions. [2022-11-16 12:28:29,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-16 12:28:29,179 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 71 states have (on average 3.816901408450704) internal successors, (271), 59 states have internal predecessors, (271), 27 states have call successors, (49), 11 states have call predecessors, (49), 21 states have return successors, (50), 32 states have call predecessors, (50), 27 states have call successors, (50) Word has length 238 [2022-11-16 12:28:29,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:28:29,200 INFO L225 Difference]: With dead ends: 7540 [2022-11-16 12:28:29,201 INFO L226 Difference]: Without dead ends: 4638 [2022-11-16 12:28:29,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 305 SyntacticMatches, 19 SemanticMatches, 109 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4104 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=607, Invalid=10915, Unknown=46, NotChecked=642, Total=12210 [2022-11-16 12:28:29,214 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 861 mSDsluCounter, 10710 mSDsCounter, 0 mSdLazyCounter, 3551 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 11084 SdHoareTripleChecker+Invalid, 5167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 3551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1314 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:28:29,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 11084 Invalid, 5167 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [302 Valid, 3551 Invalid, 0 Unknown, 1314 Unchecked, 4.1s Time] [2022-11-16 12:28:29,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4638 states. [2022-11-16 12:28:29,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4638 to 3440. [2022-11-16 12:28:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3440 states, 2715 states have (on average 1.2360957642725598) internal successors, (3356), 2725 states have internal predecessors, (3356), 485 states have call successors, (485), 202 states have call predecessors, (485), 239 states have return successors, (592), 536 states have call predecessors, (592), 484 states have call successors, (592) [2022-11-16 12:28:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 4433 transitions. [2022-11-16 12:28:29,951 INFO L78 Accepts]: Start accepts. Automaton has 3440 states and 4433 transitions. Word has length 238 [2022-11-16 12:28:29,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:28:29,952 INFO L495 AbstractCegarLoop]: Abstraction has 3440 states and 4433 transitions. [2022-11-16 12:28:29,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 71 states have (on average 3.816901408450704) internal successors, (271), 59 states have internal predecessors, (271), 27 states have call successors, (49), 11 states have call predecessors, (49), 21 states have return successors, (50), 32 states have call predecessors, (50), 27 states have call successors, (50) [2022-11-16 12:28:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3440 states and 4433 transitions. [2022-11-16 12:28:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-11-16 12:28:29,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:28:29,962 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:28:29,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:28:30,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:28:30,172 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:28:30,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:28:30,173 INFO L85 PathProgramCache]: Analyzing trace with hash -446249291, now seen corresponding path program 1 times [2022-11-16 12:28:30,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:28:30,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122349659] [2022-11-16 12:28:30,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:28:30,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:28:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:34,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:34,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:34,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:28:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:34,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:28:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:35,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:35,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:28:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:35,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:28:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:35,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:28:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:35,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:35,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 12:28:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:35,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-16 12:28:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:35,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:28:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:35,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:36,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:36,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-16 12:28:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:36,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:36,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:36,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-16 12:28:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:36,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:36,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-16 12:28:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:36,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:36,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-16 12:28:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:36,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-16 12:28:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:36,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:36,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-16 12:28:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:36,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-11-16 12:28:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:36,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-11-16 12:28:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:36,468 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 9 proven. 83 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-11-16 12:28:36,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:28:36,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122349659] [2022-11-16 12:28:36,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122349659] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:28:36,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573265110] [2022-11-16 12:28:36,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:28:36,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:28:36,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:28:36,472 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:28:36,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 12:28:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:37,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 1969 conjuncts, 148 conjunts are in the unsatisfiable core [2022-11-16 12:28:37,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:28:37,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:28:37,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-16 12:28:37,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:28:38,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:28:38,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:28:38,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:28:38,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:28:38,429 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:28:38,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:28:38,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:28:39,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:28:39,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:28:39,650 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-16 12:28:39,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-16 12:28:41,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 12:28:41,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:28:42,351 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-16 12:28:42,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2022-11-16 12:28:42,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 12:28:43,404 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-16 12:28:43,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-11-16 12:28:43,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:28:44,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:28:44,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:28:44,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:28:44,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:28:44,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:28:44,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-16 12:28:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 79 proven. 122 refuted. 9 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-16 12:28:44,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:28:46,768 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_2453 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2453) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-16 12:28:46,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573265110] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:28:46,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:28:46,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 50] total 87 [2022-11-16 12:28:46,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142224673] [2022-11-16 12:28:46,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:28:46,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-11-16 12:28:46,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:28:46,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-11-16 12:28:46,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=7020, Unknown=58, NotChecked=170, Total=7656 [2022-11-16 12:28:46,794 INFO L87 Difference]: Start difference. First operand 3440 states and 4433 transitions. Second operand has 87 states, 82 states have (on average 3.3902439024390243) internal successors, (278), 69 states have internal predecessors, (278), 28 states have call successors, (47), 14 states have call predecessors, (47), 25 states have return successors, (49), 34 states have call predecessors, (49), 28 states have call successors, (49) [2022-11-16 12:28:56,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:28:56,647 INFO L93 Difference]: Finished difference Result 9504 states and 12600 transitions. [2022-11-16 12:28:56,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-16 12:28:56,650 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 82 states have (on average 3.3902439024390243) internal successors, (278), 69 states have internal predecessors, (278), 28 states have call successors, (47), 14 states have call predecessors, (47), 25 states have return successors, (49), 34 states have call predecessors, (49), 28 states have call successors, (49) Word has length 241 [2022-11-16 12:28:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:28:56,672 INFO L225 Difference]: With dead ends: 9504 [2022-11-16 12:28:56,672 INFO L226 Difference]: Without dead ends: 6602 [2022-11-16 12:28:56,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 305 SyntacticMatches, 20 SemanticMatches, 129 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6280 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=894, Invalid=15821, Unknown=59, NotChecked=256, Total=17030 [2022-11-16 12:28:56,686 INFO L413 NwaCegarLoop]: 617 mSDtfsCounter, 1345 mSDsluCounter, 19684 mSDsCounter, 0 mSdLazyCounter, 5532 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 20301 SdHoareTripleChecker+Invalid, 10293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 5532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4434 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:28:56,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 20301 Invalid, 10293 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [327 Valid, 5532 Invalid, 0 Unknown, 4434 Unchecked, 5.5s Time] [2022-11-16 12:28:56,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6602 states. [2022-11-16 12:28:57,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6602 to 4430. [2022-11-16 12:28:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4430 states, 3530 states have (on average 1.2569405099150142) internal successors, (4437), 3559 states have internal predecessors, (4437), 609 states have call successors, (609), 237 states have call predecessors, (609), 290 states have return successors, (764), 661 states have call predecessors, (764), 608 states have call successors, (764) [2022-11-16 12:28:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4430 states to 4430 states and 5810 transitions. [2022-11-16 12:28:57,413 INFO L78 Accepts]: Start accepts. Automaton has 4430 states and 5810 transitions. Word has length 241 [2022-11-16 12:28:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:28:57,413 INFO L495 AbstractCegarLoop]: Abstraction has 4430 states and 5810 transitions. [2022-11-16 12:28:57,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 82 states have (on average 3.3902439024390243) internal successors, (278), 69 states have internal predecessors, (278), 28 states have call successors, (47), 14 states have call predecessors, (47), 25 states have return successors, (49), 34 states have call predecessors, (49), 28 states have call successors, (49) [2022-11-16 12:28:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4430 states and 5810 transitions. [2022-11-16 12:28:57,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-11-16 12:28:57,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:28:57,425 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:28:57,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:28:57,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:28:57,635 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:28:57,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:28:57,635 INFO L85 PathProgramCache]: Analyzing trace with hash -635051403, now seen corresponding path program 1 times [2022-11-16 12:28:57,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:28:57,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068741588] [2022-11-16 12:28:57,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:28:57,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:28:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:29:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:29:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:29:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:02,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:02,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:29:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:02,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:29:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:02,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:29:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:02,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:29:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:02,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 12:29:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:02,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-16 12:29:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:02,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:29:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:02,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:03,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:29:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:03,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-16 12:29:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:03,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:03,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:29:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:03,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-16 12:29:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:03,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:29:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:03,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-16 12:29:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:03,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:29:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:03,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-16 12:29:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:03,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-16 12:29:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:03,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:29:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:03,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-16 12:29:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:03,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-11-16 12:29:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:03,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-11-16 12:29:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 13 proven. 83 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-16 12:29:03,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:29:03,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068741588] [2022-11-16 12:29:03,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068741588] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:29:03,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434585241] [2022-11-16 12:29:03,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:03,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:29:03,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:29:03,576 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:29:03,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 12:29:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:04,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 1968 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-16 12:29:04,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:29:04,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:29:04,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-16 12:29:04,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2022-11-16 12:29:04,768 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2756 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2756) |c_#memory_int|)) is different from true [2022-11-16 12:29:04,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:29:04,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2022-11-16 12:29:04,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:29:04,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:29:04,971 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-16 12:29:04,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2022-11-16 12:29:05,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:29:05,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:29:05,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:29:05,675 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:29:05,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:29:06,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:29:06,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-16 12:29:07,373 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:29:07,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:29:07,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:29:08,282 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 12:29:08,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:29:08,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:29:09,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:29:09,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:29:09,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:29:09,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:29:09,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:29:09,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-16 12:29:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 98 proven. 94 refuted. 12 times theorem prover too weak. 52 trivial. 2 not checked. [2022-11-16 12:29:09,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:29:11,340 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2767 (Array Int Int)) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2767) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-16 12:29:11,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434585241] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:29:11,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:29:11,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 40] total 77 [2022-11-16 12:29:11,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224968824] [2022-11-16 12:29:11,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:29:11,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-16 12:29:11,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:29:11,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-16 12:29:11,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=5356, Unknown=25, NotChecked=298, Total=6006 [2022-11-16 12:29:11,362 INFO L87 Difference]: Start difference. First operand 4430 states and 5810 transitions. Second operand has 77 states, 73 states have (on average 3.780821917808219) internal successors, (276), 60 states have internal predecessors, (276), 27 states have call successors, (47), 12 states have call predecessors, (47), 24 states have return successors, (50), 33 states have call predecessors, (50), 27 states have call successors, (50) [2022-11-16 12:29:21,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:29:21,373 INFO L93 Difference]: Finished difference Result 10567 states and 14160 transitions. [2022-11-16 12:29:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-11-16 12:29:21,376 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 73 states have (on average 3.780821917808219) internal successors, (276), 60 states have internal predecessors, (276), 27 states have call successors, (47), 12 states have call predecessors, (47), 24 states have return successors, (50), 33 states have call predecessors, (50), 27 states have call successors, (50) Word has length 241 [2022-11-16 12:29:21,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:29:21,399 INFO L225 Difference]: With dead ends: 10567 [2022-11-16 12:29:21,400 INFO L226 Difference]: Without dead ends: 7665 [2022-11-16 12:29:21,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 312 SyntacticMatches, 21 SemanticMatches, 117 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4799 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=785, Invalid=12758, Unknown=37, NotChecked=462, Total=14042 [2022-11-16 12:29:21,409 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 1964 mSDsluCounter, 9916 mSDsCounter, 0 mSdLazyCounter, 4885 mSolverCounterSat, 727 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1985 SdHoareTripleChecker+Valid, 10340 SdHoareTripleChecker+Invalid, 7654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 727 IncrementalHoareTripleChecker+Valid, 4885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2042 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:29:21,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1985 Valid, 10340 Invalid, 7654 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [727 Valid, 4885 Invalid, 0 Unknown, 2042 Unchecked, 5.6s Time] [2022-11-16 12:29:21,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7665 states. [2022-11-16 12:29:22,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7665 to 4699. [2022-11-16 12:29:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4699 states, 3747 states have (on average 1.2580731251668) internal successors, (4714), 3780 states have internal predecessors, (4714), 629 states have call successors, (629), 257 states have call predecessors, (629), 322 states have return successors, (802), 689 states have call predecessors, (802), 628 states have call successors, (802) [2022-11-16 12:29:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4699 states to 4699 states and 6145 transitions. [2022-11-16 12:29:22,263 INFO L78 Accepts]: Start accepts. Automaton has 4699 states and 6145 transitions. Word has length 241 [2022-11-16 12:29:22,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:29:22,264 INFO L495 AbstractCegarLoop]: Abstraction has 4699 states and 6145 transitions. [2022-11-16 12:29:22,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 73 states have (on average 3.780821917808219) internal successors, (276), 60 states have internal predecessors, (276), 27 states have call successors, (47), 12 states have call predecessors, (47), 24 states have return successors, (50), 33 states have call predecessors, (50), 27 states have call successors, (50) [2022-11-16 12:29:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 4699 states and 6145 transitions. [2022-11-16 12:29:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2022-11-16 12:29:22,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:22,275 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:22,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:29:22,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-16 12:29:22,490 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:29:22,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash -615893863, now seen corresponding path program 1 times [2022-11-16 12:29:22,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:29:22,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486206133] [2022-11-16 12:29:22,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:29:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:29:23,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:29:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:29:24,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:29:24,460 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:29:24,461 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 12:29:24,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 12:29:24,467 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:24,472 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:29:24,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:29:24 BoogieIcfgContainer [2022-11-16 12:29:24,870 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:29:24,871 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:29:24,871 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:29:24,871 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:29:24,872 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:03" (3/4) ... [2022-11-16 12:29:24,875 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 12:29:24,875 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:29:24,875 INFO L158 Benchmark]: Toolchain (without parser) took 144466.86ms. Allocated memory was 100.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 64.2MB in the beginning and 691.1MB in the end (delta: -626.9MB). Peak memory consumption was 622.9MB. Max. memory is 16.1GB. [2022-11-16 12:29:24,876 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 100.7MB. Free memory is still 51.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:29:24,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1269.24ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 64.2MB in the beginning and 73.8MB in the end (delta: -9.5MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2022-11-16 12:29:24,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 140.54ms. Allocated memory is still 121.6MB. Free memory was 73.8MB in the beginning and 67.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-16 12:29:24,877 INFO L158 Benchmark]: Boogie Preprocessor took 114.09ms. Allocated memory is still 121.6MB. Free memory was 67.5MB in the beginning and 61.7MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-16 12:29:24,877 INFO L158 Benchmark]: RCFGBuilder took 1389.12ms. Allocated memory is still 121.6MB. Free memory was 61.7MB in the beginning and 65.2MB in the end (delta: -3.5MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2022-11-16 12:29:24,877 INFO L158 Benchmark]: TraceAbstraction took 141542.89ms. Allocated memory was 121.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 64.6MB in the beginning and 691.1MB in the end (delta: -626.6MB). Peak memory consumption was 603.3MB. Max. memory is 16.1GB. [2022-11-16 12:29:24,877 INFO L158 Benchmark]: Witness Printer took 4.27ms. Allocated memory is still 1.4GB. Free memory is still 691.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:29:24,879 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 100.7MB. Free memory is still 51.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1269.24ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 64.2MB in the beginning and 73.8MB in the end (delta: -9.5MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 140.54ms. Allocated memory is still 121.6MB. Free memory was 73.8MB in the beginning and 67.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.09ms. Allocated memory is still 121.6MB. Free memory was 67.5MB in the beginning and 61.7MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1389.12ms. Allocated memory is still 121.6MB. Free memory was 61.7MB in the beginning and 65.2MB in the end (delta: -3.5MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * TraceAbstraction took 141542.89ms. Allocated memory was 121.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 64.6MB in the beginning and 691.1MB in the end (delta: -626.6MB). Peak memory consumption was 603.3MB. Max. memory is 16.1GB. * Witness Printer took 4.27ms. Allocated memory is still 1.4GB. Free memory is still 691.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 4063]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 3350, overapproximation of strlen at line 3778, overapproximation of bitwiseOr at line 3801, overapproximation of bitwiseAnd at line 3397. Possible FailurePath: [L4069] int SERIAL_STATE = 0; [L4071] struct urb *int_urb = (struct urb *)0; [L3543] int LDV_IN_INTERRUPT = 1; [L3837] struct usb_device_id const __mod_usb_device_table ; [L4070] void *usb_intfdata = (void *)0; [L4067] int DEV_STATE = 0; [L4073] void (*completeFnInt)(struct urb * ) ; [L4072] struct urb *bulk_urb = (struct urb *)0; [L3865] int ldv_retval_0 ; [L3866] int ldv_retval_1 ; [L4074] void (*completeFnBulk)(struct urb * ) ; [L3544] int ref_cnt ; [L3838-L3843] static struct usb_driver usb_acecad_driver = {"usb_acecad", & usb_acecad_probe, & usb_acecad_disconnect, 0, 0, 0, 0, 0, 0, (struct usb_device_id const *)(& usb_acecad_id_table), {{{{{0U}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, {{0, 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}, (unsigned char)0, (unsigned char)0, (unsigned char)0}; [L4068] int INTERF_STATE = 0; [L3548] int ldv_state_variable_0 ; [L3545] int ldv_state_variable_1 ; [L3832-L3836] static struct usb_device_id usb_acecad_id_table[3U] = { {3U, 1120U, 4U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1120U, 8U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 1UL}}; [L3546] int usb_counter ; [L3547] struct usb_interface *usb_acecad_driver_group1 ; [L4066] int URB_STATE = 0; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3880] struct usb_device_id *ldvarg0 ; [L3881] void *tmp ; [L3882] int tmp___0 ; [L3883] int tmp___1 ; [L3884] int tmp___2 ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] CALL, EXPR ldv_init_zalloc(24UL) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3497] void *p ; [L3498] void *tmp ; [L3500] EXPR, FCALL calloc(1UL, size) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, size=24, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3500] tmp = calloc(1UL, size) [L3501] p = tmp VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3503] return (p); VAL [={0:0}, ={0:0}, \old(size)=24, \result={-18446744073709551617:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] RET, EXPR ldv_init_zalloc(24UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(24UL)={-18446744073709551617:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] tmp = ldv_init_zalloc(24UL) [L3887] ldvarg0 = (struct usb_device_id *)tmp [L3888] FCALL ldv_initialize() [L3889] ldv_state_variable_1 = 0 [L3890] ref_cnt = 0 [L3891] ldv_state_variable_0 = 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] case 0: [L3925] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3926] COND TRUE ldv_state_variable_0 != 0 [L3927] tmp___2 = __VERIFIER_nondet_int() [L3929] case 0: [L3937] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3938] COND TRUE ldv_state_variable_0 == 1 [L3939] CALL, EXPR usb_acecad_init() [L3846] int result ; [L3847] int tmp ; [L3849] CALL, EXPR usb_register(& usb_acecad_driver) [L3359] int tmp ; [L3361] CALL, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3980] ldv_func_ret_type ldv_func_res ; [L3981] int tmp ; [L3983] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L4343] return __VERIFIER_nondet_int(); [L3983] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3983] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3984] ldv_func_res = tmp [L3985] ldv_state_variable_1 = 1 [L3986] usb_counter = 0 [L3987] CALL ldv_usb_driver_1() [L3871] void *tmp ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] CALL, EXPR ldv_init_zalloc(1248UL) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3497] void *p ; [L3498] void *tmp ; [L3500] EXPR, FCALL calloc(1UL, size) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, calloc(1UL, size)={-55340232221128654849:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1248, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3500] tmp = calloc(1UL, size) [L3501] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, calloc(1UL, size)={-55340232221128654849:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, calloc(1UL, size)={-55340232221128654849:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3503] return (p); VAL [={0:0}, ={0:0}, \old(size)=1248, \result={-55340232221128654849:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, calloc(1UL, size)={-55340232221128654849:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] RET, EXPR ldv_init_zalloc(1248UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1248UL)={-55340232221128654849:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] tmp = ldv_init_zalloc(1248UL) [L3874] usb_acecad_driver_group1 = (struct usb_interface *)tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3987] RET ldv_usb_driver_1() [L3988] return (ldv_func_res); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, ldv_func_arg1={14:0}, ldv_func_arg1={14:0}, ldv_func_arg2={18446744073709551617:18446744073709551639}, ldv_func_arg2={18446744073709551617:18446744073709551639}, ldv_func_arg3={4:0}, ldv_func_arg3={4:0}, ldv_func_res=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3361] RET, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3361] tmp = ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3362] return (tmp); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, driver={14:0}, driver={14:0}, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3849] RET, EXPR usb_register(& usb_acecad_driver) [L3849] tmp = usb_register(& usb_acecad_driver) [L3850] result = tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3851] COND TRUE result == 0 [L3855] return (result); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3939] RET, EXPR usb_acecad_init() [L3939] ldv_retval_1 = usb_acecad_init() [L3940] COND TRUE ldv_retval_1 == 0 [L3941] ldv_state_variable_0 = 3 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3944] COND FALSE !(ldv_retval_1 != 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=0, tmp___2=1, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3896] COND TRUE ldv_state_variable_1 != 0 [L3897] tmp___1 = __VERIFIER_nondet_int() [L3899] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=0, tmp___1=0, tmp___2=1, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3900] COND TRUE ldv_state_variable_1 == 1 [L3901] CALL, EXPR usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3693] struct usb_device *dev ; [L3694] struct usb_device *tmp ; [L3695] struct usb_host_interface *interface ; [L3696] struct usb_endpoint_descriptor *endpoint ; [L3697] struct usb_acecad *acecad ; [L3698] struct input_dev *input_dev ; [L3699] int pipe ; [L3700] int maxp ; [L3701] int err ; [L3702] int tmp___0 ; [L3703] unsigned int tmp___1 ; [L3704] __u16 tmp___2 ; [L3705] void *tmp___3 ; [L3706] void *tmp___4 ; [L3707] size_t tmp___5 ; [L3708] size_t tmp___6 ; [L3710] CALL, EXPR interface_to_usbdev(intf) [L3971] struct usb_device *tmp ; [L3973] CALL, EXPR ldv_interface_to_usbdev() [L4189] void *result ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] CALL, EXPR ldv_malloc(sizeof(struct usb_device)) VAL [={0:0}, ={0:0}, \old(size)=1822, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1822, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103231:0}, ref_cnt=0, SERIAL_STATE=0, size=1822, tmp={-36893488147419103231:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1822, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103231:0}, ref_cnt=0, SERIAL_STATE=0, size=1822, tmp={-36893488147419103231:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=1822, \result={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103231:0}, ref_cnt=0, SERIAL_STATE=0, size=1822, tmp={-36893488147419103231:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] RET, EXPR ldv_malloc(sizeof(struct usb_device)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct usb_device))={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] result = ldv_malloc(sizeof(struct usb_device)) [L4195] COND FALSE !((unsigned long )result == (unsigned long )((void *)0)) [L4199] return ((struct usb_device *)result); VAL [={0:0}, ={0:0}, \result={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result={-36893488147419103231:0}, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3973] RET, EXPR ldv_interface_to_usbdev() [L3973] tmp = ldv_interface_to_usbdev() [L3974] return (tmp); VAL [={0:0}, ={0:0}, \result={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, intf={-55340232221128654849:0}, intf={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3710] RET, EXPR interface_to_usbdev(intf) [L3710] tmp = interface_to_usbdev(intf) [L3711] dev = tmp [L3712] EXPR intf->cur_altsetting [L3712] interface = intf->cur_altsetting [L3713] EXPR interface->desc.bNumEndpoints VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, dev={-36893488147419103231:0}, DEV_STATE=0, id={-18446744073709551617:0}, id={-18446744073709551617:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-11}, interface->desc.bNumEndpoints=-255, intf={-55340232221128654849:0}, intf={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3713] COND FALSE !((unsigned int )interface->desc.bNumEndpoints != 1U) [L3717] EXPR interface->endpoint [L3717] endpoint = & (interface->endpoint)->desc [L3718] CALL, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3314] int tmp ; [L3315] int tmp___0 ; [L3316] int tmp___1 ; [L3318] CALL, EXPR usb_endpoint_xfer_int(epd) [L3309] EXPR epd->bmAttributes [L3309] return (((int )epd->bmAttributes & 3) == 3); [L3318] RET, EXPR usb_endpoint_xfer_int(epd) [L3318] tmp = usb_endpoint_xfer_int(epd) [L3319] COND TRUE tmp != 0 [L3320] CALL, EXPR usb_endpoint_dir_in(epd) [L3303] EXPR epd->bEndpointAddress [L3303] return ((int )((signed char )epd->bEndpointAddress) < 0); [L3320] RET, EXPR usb_endpoint_dir_in(epd) [L3320] tmp___0 = usb_endpoint_dir_in(epd) [L3321] COND TRUE tmp___0 != 0 [L3322] tmp___1 = 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, epd={-55340232221128654847:19}, epd={-55340232221128654847:19}, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=1, tmp___0=1, tmp___1=1, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3329] return (tmp___1); VAL [={0:0}, ={0:0}, \result=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, epd={-55340232221128654847:19}, epd={-55340232221128654847:19}, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=1, tmp___0=1, tmp___1=1, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3718] RET, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3718] tmp___0 = usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3719] COND FALSE !(tmp___0 == 0) [L3723] EXPR endpoint->bEndpointAddress [L3723] CALL, EXPR __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3383] EXPR dev->devnum [L3383] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L3723] RET, EXPR __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3723] tmp___1 = __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3724] pipe = (int )(tmp___1 | 1073741952U) [L3725] CALL, EXPR usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3388] struct usb_host_endpoint *ep ; [L3389] unsigned int epnum ; [L3390] int __ret_warn_on ; [L3391] long tmp ; [L3392] int __ret_warn_on___0 ; [L3393] long tmp___0 ; VAL [={0:0}, ={0:0}, \old(is_out)=1, \old(pipe)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, is_out=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=0, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3395] epnum = (unsigned int )(pipe >> 15) & 15U VAL [={0:0}, ={0:0}, \old(is_out)=1, \old(pipe)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=0, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3396] COND TRUE is_out != 0 [L3397] __ret_warn_on = (pipe & 128) != 0 VAL [={0:0}, ={0:0}, \old(is_out)=1, \old(pipe)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=0, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3398] CALL, EXPR ldv__builtin_expect(__ret_warn_on != 0, 0L) VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3540] return (exp); VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, c=0, DEV_STATE=0, exp=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3398] RET, EXPR ldv__builtin_expect(__ret_warn_on != 0, 0L) VAL [={0:0}, ={0:0}, \old(is_out)=1, \old(pipe)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=1, ldv__builtin_expect(__ret_warn_on != 0, 0L)=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=0, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3398] tmp = ldv__builtin_expect(__ret_warn_on != 0, 0L) [L3399] COND FALSE !(tmp != 0L) VAL [={0:0}, ={0:0}, \old(is_out)=1, \old(pipe)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=0, ref_cnt=0, SERIAL_STATE=0, tmp=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3403] CALL ldv__builtin_expect(__ret_warn_on != 0, 0L) VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3540] return (exp); VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, c=0, DEV_STATE=0, exp=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3403] RET ldv__builtin_expect(__ret_warn_on != 0, 0L) VAL [={0:0}, ={0:0}, \old(is_out)=1, \old(pipe)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=1, ldv__builtin_expect(__ret_warn_on != 0, 0L)=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=0, ref_cnt=0, SERIAL_STATE=0, tmp=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3404] EXPR udev->ep_out[epnum] [L3404] ep = udev->ep_out[epnum] [L3415] COND TRUE (unsigned long )ep == (unsigned long )((struct usb_host_endpoint *)0) [L3416] return (0U); VAL [={0:0}, ={0:0}, \old(is_out)=1, \old(pipe)=0, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, ep={18446744073709551599:17}, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=0, ref_cnt=0, SERIAL_STATE=0, tmp=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3725] RET, EXPR usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3725] tmp___2 = usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3726] maxp = (int )tmp___2 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, dev={-36893488147419103231:0}, DEV_STATE=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-11}, intf={-55340232221128654849:0}, intf={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3727] CALL, EXPR kzalloc(232UL, 208U) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3447] void *tmp ; [L3449] CALL, EXPR kmalloc(size, flags | 32768U) [L3438] void *tmp___1 ; [L3440] CALL, EXPR __kmalloc(size, flags) [L3433] CALL, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=232, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=232, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654847:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654847:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=232, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654847:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654847:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=232, \result={-55340232221128654847:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654847:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654847:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] RET, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=232, \old(t)=32768, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-55340232221128654847:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=232, t=32768, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] return ldv_malloc(size); [L3440] RET, EXPR __kmalloc(size, flags) [L3440] tmp___1 = __kmalloc(size, flags) [L3441] return (tmp___1); VAL [={0:0}, ={0:0}, \old(flags)=32768, \old(size)=232, \result={-55340232221128654847:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, flags=32768, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=232, tmp___1={-55340232221128654847:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3449] RET, EXPR kmalloc(size, flags | 32768U) [L3449] tmp = kmalloc(size, flags | 32768U) [L3450] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=208, \old(size)=232, \result={-55340232221128654847:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, flags=208, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654847:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3727] RET, EXPR kzalloc(232UL, 208U) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, dev={-36893488147419103231:0}, DEV_STATE=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-11}, intf={-55340232221128654849:0}, intf={-55340232221128654849:0}, kzalloc(232UL, 208U)={-55340232221128654847:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3727] tmp___3 = kzalloc(232UL, 208U) [L3728] acecad = (struct usb_acecad *)tmp___3 [L3729] CALL, EXPR input_allocate_device() [L3551] CALL, EXPR kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3447] void *tmp ; [L3449] CALL, EXPR kmalloc(size, flags | 32768U) [L3438] void *tmp___1 ; [L3440] CALL, EXPR __kmalloc(size, flags) [L3433] CALL, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=1855, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1855, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-73786976294838206463:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-73786976294838206463:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1855, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-73786976294838206463:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-73786976294838206463:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=1855, \result={-73786976294838206463:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-73786976294838206463:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-73786976294838206463:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] RET, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=1855, \old(t)=32768, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-73786976294838206463:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1855, t=32768, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] return ldv_malloc(size); [L3440] RET, EXPR __kmalloc(size, flags) [L3440] tmp___1 = __kmalloc(size, flags) [L3441] return (tmp___1); VAL [={0:0}, ={0:0}, \old(flags)=32768, \old(size)=1855, \result={-73786976294838206463:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, flags=32768, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp___1={-73786976294838206463:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3449] RET, EXPR kmalloc(size, flags | 32768U) [L3449] tmp = kmalloc(size, flags | 32768U) [L3450] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=128, \old(size)=1855, \result={-73786976294838206463:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, flags=128, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-73786976294838206463:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3551] RET, EXPR kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u)={-73786976294838206463:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3551] return kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u); [L3729] RET, EXPR input_allocate_device() [L3729] input_dev = input_allocate_device() [L3730] COND FALSE !((unsigned long )acecad == (unsigned long )((struct usb_acecad *)0) || (unsigned long )input_dev == (unsigned long )((struct input_dev *)0)) [L3735] CALL, EXPR usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L4324] CALL, EXPR ldv_malloc(0UL) VAL [={0:0}, ={0:0}, \old(size)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-92233720368547758079:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-92233720368547758079:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-92233720368547758079:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-92233720368547758079:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=0, \result={-92233720368547758079:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-92233720368547758079:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-92233720368547758079:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L4324] RET, EXPR ldv_malloc(0UL) VAL [={0:0}, ={0:0}, \old(arg1)=8, \old(arg2)=208, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, arg0={-36893488147419103231:0}, arg0={-36893488147419103231:0}, arg1=8, arg2=208, arg3={-55340232221128654847:224}, arg3={-55340232221128654847:224}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-92233720368547758079:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L4324] return ldv_malloc(0UL); [L3735] RET, EXPR usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L3735] tmp___4 = usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L3736] acecad->data = (unsigned char *)tmp___4 [L3737] EXPR acecad->data VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, acecad={-55340232221128654847:0}, acecad->data={-92233720368547758079:0}, bulk_urb={0:0}, dev={-36893488147419103231:0}, DEV_STATE=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-73786976294838206463:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-11}, intf={-55340232221128654849:0}, intf={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-92233720368547758079:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3737] COND FALSE !((unsigned long )acecad->data == (unsigned long )((unsigned char *)0U)) [L3742] CALL, EXPR ldv_usb_alloc_urb_5(0, 208U) [L4009] ldv_func_ret_type___0 ldv_func_res ; [L4010] struct urb *tmp ; [L4012] CALL, EXPR usb_alloc_urb(ldv_func_arg1, ldv_func_arg2) [L4327] CALL, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-18446744073709551615:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-18446744073709551615:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=180, \result={-18446744073709551615:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-18446744073709551615:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L4327] RET, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, \old(arg0)=0, \old(arg1)=208, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, arg0=0, arg1=208, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct urb))={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L4327] return ldv_malloc(sizeof(struct urb)); [L4012] RET, EXPR usb_alloc_urb(ldv_func_arg1, ldv_func_arg2) [L4012] tmp = usb_alloc_urb(ldv_func_arg1, ldv_func_arg2) [L4013] ldv_func_res = tmp [L4014] CALL ldv_alloc_urb(ldv_func_res) [L4098] COND TRUE (unsigned long )res != (unsigned long )((struct urb *)0) [L4099] URB_STATE = URB_STATE + 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, res={-18446744073709551615:0}, res={-18446744073709551615:0}, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L4014] RET ldv_alloc_urb(ldv_func_res) [L4015] return (ldv_func_res); VAL [={0:0}, ={0:0}, \old(ldv_func_arg1)=0, \old(ldv_func_arg2)=208, \result={-18446744073709551615:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, ldv_func_arg1=0, ldv_func_arg2=208, ldv_func_res={-18446744073709551615:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551615:0}, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3742] RET, EXPR ldv_usb_alloc_urb_5(0, 208U) [L3742] acecad->irq = ldv_usb_alloc_urb_5(0, 208U) [L3743] EXPR acecad->irq VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, acecad={-55340232221128654847:0}, acecad->irq={-18446744073709551615:0}, bulk_urb={0:0}, dev={-36893488147419103231:0}, DEV_STATE=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-73786976294838206463:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-11}, intf={-55340232221128654849:0}, intf={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-92233720368547758079:0}, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3743] COND FALSE !((unsigned long )acecad->irq == (unsigned long )((struct urb *)0)) [L3748] acecad->usbdev = dev [L3749] acecad->input = input_dev [L3750] EXPR dev->manufacturer VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, acecad={-55340232221128654847:0}, bulk_urb={0:0}, dev={-36893488147419103231:0}, dev->manufacturer={18:18446744073709551598}, DEV_STATE=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-73786976294838206463:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-11}, intf={-55340232221128654849:0}, intf={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-92233720368547758079:0}, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3750] COND FALSE !((unsigned long )dev->manufacturer != (unsigned long )((char *)0)) [L3754] EXPR dev->product VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, acecad={-55340232221128654847:0}, bulk_urb={0:0}, dev={-36893488147419103231:0}, dev->product={23:18446744073709551593}, DEV_STATE=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-73786976294838206463:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-11}, intf={-55340232221128654849:0}, intf={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-92233720368547758079:0}, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3754] COND FALSE !((unsigned long )dev->product != (unsigned long )((char *)0)) [L3762] CALL usb_make_path(dev, (char *)(& acecad->phys), 64UL) [L3348] int actual ; [L3350] EXPR dev->bus [L3350] EXPR (dev->bus)->bus_name [L3350] actual = snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath)) [L3351] return ((int )size > actual ? actual : -1); VAL [={0:0}, ={0:0}, \old(size)=64, \result=-1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, actual=-1, buf={-55340232221128654847:128}, buf={-55340232221128654847:128}, bulk_urb={0:0}, dev={-36893488147419103231:0}, dev={-36893488147419103231:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=64, snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath))=-1, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3762] RET usb_make_path(dev, (char *)(& acecad->phys), 64UL) [L3763] CALL strlcat((char *)(& acecad->phys), "/input0", 64UL) VAL [={0:0}, ={0:0}, \old(arg2)=64, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, arg0={-55340232221128654847:128}, arg1={9:0}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L4317] return __VERIFIER_nondet_ulong(); [L3763] RET strlcat((char *)(& acecad->phys), "/input0", 64UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, acecad={-55340232221128654847:0}, bulk_urb={0:0}, dev={-36893488147419103231:0}, DEV_STATE=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-73786976294838206463:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-11}, intf={-55340232221128654849:0}, intf={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=0, ref_cnt=0, SERIAL_STATE=0, strlcat((char *)(& acecad->phys), "/input0", 64UL)=18446744073709551642, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-92233720368547758079:0}, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3764] input_dev->name = (char const *)(& acecad->name) [L3765] input_dev->phys = (char const *)(& acecad->phys) [L3766] CALL usb_to_input_id((struct usb_device const *)dev, & input_dev->id) [L3600] id->bustype = 3U [L3601] EXPR dev->descriptor.idVendor [L3601] id->vendor = dev->descriptor.idVendor [L3602] EXPR dev->descriptor.idProduct [L3602] id->product = dev->descriptor.idProduct [L3603] EXPR dev->descriptor.bcdDevice [L3603] id->version = dev->descriptor.bcdDevice [L3766] RET usb_to_input_id((struct usb_device const *)dev, & input_dev->id) [L3767] input_dev->dev.parent = & intf->dev [L3768] CALL input_set_drvdata(input_dev, (void *)acecad) [L3565] FCALL dev_set_drvdata(& dev->dev, data) [L3768] RET input_set_drvdata(input_dev, (void *)acecad) [L3769] input_dev->open = & usb_acecad_open [L3770] input_dev->close = & usb_acecad_close [L3771] input_dev->evbit[0] = 10UL [L3772] input_dev->keybit[5] = 7169UL [L3773] id->driver_info [L3774] case 0UL: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, acecad={-55340232221128654847:0}, bulk_urb={0:0}, dev={-36893488147419103231:0}, DEV_STATE=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-73786976294838206463:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-11}, intf={-55340232221128654849:0}, intf={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-92233720368547758079:0}, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3775] FCALL input_set_abs_params(input_dev, 0U, 0, 5000, 4, 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, acecad={-55340232221128654847:0}, bulk_urb={0:0}, dev={-36893488147419103231:0}, DEV_STATE=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-73786976294838206463:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-11}, intf={-55340232221128654849:0}, intf={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-92233720368547758079:0}, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3776] FCALL input_set_abs_params(input_dev, 1U, 0, 3750, 4, 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, acecad={-55340232221128654847:0}, bulk_urb={0:0}, dev={-36893488147419103231:0}, DEV_STATE=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-73786976294838206463:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-11}, intf={-55340232221128654849:0}, intf={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-92233720368547758079:0}, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3777] FCALL input_set_abs_params(input_dev, 24U, 0, 512, 0, 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, acecad={-55340232221128654847:0}, bulk_urb={0:0}, dev={-36893488147419103231:0}, DEV_STATE=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-73786976294838206463:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-11}, intf={-55340232221128654849:0}, intf={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-92233720368547758079:0}, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3778] tmp___5 = strlen((char const *)(& acecad->name)) [L3779] COND TRUE tmp___5 == 0UL [L3781] dev->descriptor.idVendor [L3781] dev->descriptor.idProduct [L3798] EXPR acecad->irq [L3798] EXPR acecad->data [L3799] EXPR endpoint->bInterval [L3798-L3799] CALL ldv_usb_fill_int_urb_6(acecad->irq, dev, (unsigned int )pipe, (void *)acecad->data, 8 < maxp ? 8 : maxp, & usb_acecad_irq, (void *)acecad, (int )endpoint->bInterval) [L4024] CALL ldv_fill_int_urb(complete_fn) [L4120] struct urb *value ; [L4121] int tmp___0 ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L4123] CALL, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-36893488147419103233:0}, tmp___0=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-36893488147419103233:0}, tmp___0=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=180, \result={-36893488147419103233:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-36893488147419103233:0}, tmp___0=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L4123] RET, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct urb))={-36893488147419103233:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L4123] value = ldv_malloc(sizeof(struct urb)) [L4124] COND FALSE !((unsigned long )value == (unsigned long )((struct urb *)0)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}, value={-36893488147419103233:0}] [L4128] CALL, EXPR ldv_undef_int() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3516] int tmp ; [L3518] tmp = __VERIFIER_nondet_int() [L3519] return (tmp); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L4128] RET, EXPR ldv_undef_int() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_undef_int()=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}, value={-36893488147419103233:0}] [L4128] tmp___0 = ldv_undef_int() [L4129] COND FALSE !(tmp___0 != 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}, value={-36893488147419103233:0}] [L4024] RET ldv_fill_int_urb(complete_fn) [L3798-L3799] RET ldv_usb_fill_int_urb_6(acecad->irq, dev, (unsigned int )pipe, (void *)acecad->data, 8 < maxp ? 8 : maxp, & usb_acecad_irq, (void *)acecad, (int )endpoint->bInterval) [L3800] EXPR acecad->irq [L3800] EXPR acecad->data_dma [L3800] (acecad->irq)->transfer_dma = acecad->data_dma [L3801] EXPR acecad->irq [L3801] EXPR acecad->irq [L3801] EXPR (acecad->irq)->transfer_flags [L3801] (acecad->irq)->transfer_flags = (acecad->irq)->transfer_flags | 4U [L3802] EXPR acecad->input [L3802] CALL, EXPR input_register_device(acecad->input) [L4300] return __VERIFIER_nondet_int(); [L3802] RET, EXPR input_register_device(acecad->input) [L3802] err = input_register_device(acecad->input) [L3803] COND TRUE err != 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, acecad={-55340232221128654847:0}, bulk_urb={0:0}, dev={-36893488147419103231:0}, DEV_STATE=0, endpoint={-55340232221128654847:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-73786976294838206463:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-11}, intf={-55340232221128654849:0}, intf={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-92233720368547758079:0}, tmp___5=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3810] EXPR acecad->data [L3810] EXPR acecad->data_dma VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, acecad={-55340232221128654847:0}, acecad->data={-92233720368547758079:0}, acecad->data_dma=18446744073709551645, bulk_urb={0:0}, dev={-36893488147419103231:0}, DEV_STATE=0, endpoint={-55340232221128654847:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-73786976294838206463:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-11}, intf={-55340232221128654849:0}, intf={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-92233720368547758079:0}, tmp___5=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3810] FCALL usb_free_coherent(dev, 8UL, (void *)acecad->data, acecad->data_dma) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, acecad={-55340232221128654847:0}, acecad->data={-92233720368547758079:0}, acecad->data_dma=18446744073709551645, bulk_urb={0:0}, dev={-36893488147419103231:0}, DEV_STATE=0, endpoint={-55340232221128654847:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-73786976294838206463:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-11}, intf={-55340232221128654849:0}, intf={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-92233720368547758079:0}, tmp___5=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3812] FCALL input_free_device(input_dev) [L3813] CALL kfree((void const *)acecad) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654847:0}, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3813] RET kfree((void const *)acecad) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, acecad={-55340232221128654847:0}, bulk_urb={0:0}, dev={-36893488147419103231:0}, DEV_STATE=0, endpoint={-55340232221128654847:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-73786976294838206463:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-11}, intf={-55340232221128654849:0}, intf={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-92233720368547758079:0}, tmp___5=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3814] return (err); VAL [={0:0}, ={0:0}, \result=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, acecad={-55340232221128654847:0}, bulk_urb={0:0}, dev={-36893488147419103231:0}, DEV_STATE=0, endpoint={-55340232221128654847:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-73786976294838206463:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-11}, intf={-55340232221128654849:0}, intf={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-92233720368547758079:0}, tmp___5=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3901] RET, EXPR usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3901] ldv_retval_0 = usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3902] COND FALSE !(ldv_retval_0 == 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=0, tmp___1=0, tmp___2=1, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] case 0: [L3925] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___1=0, tmp___2=1, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3926] COND TRUE ldv_state_variable_0 != 0 [L3927] tmp___2 = __VERIFIER_nondet_int() [L3929] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___1=0, tmp___2=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3930] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L3931] CALL usb_acecad_exit() [L3861] CALL ldv_usb_deregister_11(& usb_acecad_driver) [L4054] FCALL usb_deregister(arg) [L4055] ldv_state_variable_1 = 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, arg={14:0}, arg={14:0}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3861] RET ldv_usb_deregister_11(& usb_acecad_driver) [L3931] RET usb_acecad_exit() [L3932] ldv_state_variable_0 = 2 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___1=0, tmp___2=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3965] CALL ldv_check_final_state() [L4267] COND TRUE URB_STATE != 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L4268] CALL ldv_error() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L4063] reach_error() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-55340232221128654849:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 232 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 141.1s, OverallIterations: 23, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 51.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12097 SdHoareTripleChecker+Valid, 27.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11680 mSDsluCounter, 87803 SdHoareTripleChecker+Invalid, 24.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 14742 IncrementalHoareTripleChecker+Unchecked, 79834 mSDsCounter, 3273 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22917 IncrementalHoareTripleChecker+Invalid, 40932 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3273 mSolverCounterUnsat, 7969 mSDtfsCounter, 22917 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4001 GetRequests, 3167 SyntacticMatches, 110 SemanticMatches, 724 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 20874 ImplicationChecksByTransitivity, 45.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4699occurred in iteration=22, InterpolantAutomatonStates: 467, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 20429 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 68.4s InterpolantComputationTime, 5843 NumberOfCodeBlocks, 5718 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 5733 ConstructedInterpolants, 548 QuantifiedInterpolants, 28392 SizeOfPredicates, 237 NumberOfNonLiveVariables, 17980 ConjunctsInSsa, 873 ConjunctsInUnsatCore, 34 InterpolantComputations, 15 PerfectInterpolantSequences, 2989/3828 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-16 12:29:24,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:29:27,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:29:27,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:29:27,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:29:27,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:29:27,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:29:27,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:29:27,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:29:27,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:29:27,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:29:27,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:29:27,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:29:27,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:29:27,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:29:27,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:29:27,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:29:27,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:29:27,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:29:27,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:29:27,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:29:27,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:29:27,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:29:27,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:29:27,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:29:27,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:29:27,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:29:27,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:29:27,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:29:27,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:29:27,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:29:27,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:29:27,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:29:27,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:29:27,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:29:27,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:29:27,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:29:27,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:29:27,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:29:27,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:29:27,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:29:27,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:29:27,404 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-16 12:29:27,467 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:29:27,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:29:27,468 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:29:27,468 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:29:27,469 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:29:27,469 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:29:27,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:29:27,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:29:27,471 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:29:27,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:29:27,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:29:27,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:29:27,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:29:27,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:29:27,473 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:29:27,474 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 12:29:27,474 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 12:29:27,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:29:27,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:29:27,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:29:27,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:29:27,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:29:27,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:29:27,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:29:27,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:29:27,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:29:27,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:29:27,477 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 12:29:27,477 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 12:29:27,477 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:29:27,477 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:29:27,477 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:29:27,478 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 12:29:27,478 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b [2022-11-16 12:29:27,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:29:27,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:29:27,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:29:27,903 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:29:27,906 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:29:27,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-16 12:29:27,984 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/data/0985d9484/1eafcdfa25404459a67933c0e4e3ab27/FLAG378735a36 [2022-11-16 12:29:28,738 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:29:28,739 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-16 12:29:28,773 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/data/0985d9484/1eafcdfa25404459a67933c0e4e3ab27/FLAG378735a36 [2022-11-16 12:29:28,828 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/data/0985d9484/1eafcdfa25404459a67933c0e4e3ab27 [2022-11-16 12:29:28,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:29:28,832 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:29:28,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:29:28,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:29:28,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:29:28,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:29:28" (1/1) ... [2022-11-16 12:29:28,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35cc2211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:28, skipping insertion in model container [2022-11-16 12:29:28,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:29:28" (1/1) ... [2022-11-16 12:29:28,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:29:28,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:29:29,808 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-11-16 12:29:29,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:29:29,915 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-16 12:29:29,937 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:29:30,061 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-11-16 12:29:30,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:29:30,078 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:29:30,253 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-11-16 12:29:30,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:29:30,311 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:29:30,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:30 WrapperNode [2022-11-16 12:29:30,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:29:30,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:29:30,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:29:30,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:29:30,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:30" (1/1) ... [2022-11-16 12:29:30,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:30" (1/1) ... [2022-11-16 12:29:30,455 INFO L138 Inliner]: procedures = 118, calls = 318, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 750 [2022-11-16 12:29:30,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:29:30,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:29:30,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:29:30,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:29:30,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:30" (1/1) ... [2022-11-16 12:29:30,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:30" (1/1) ... [2022-11-16 12:29:30,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:30" (1/1) ... [2022-11-16 12:29:30,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:30" (1/1) ... [2022-11-16 12:29:30,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:30" (1/1) ... [2022-11-16 12:29:30,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:30" (1/1) ... [2022-11-16 12:29:30,580 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:30" (1/1) ... [2022-11-16 12:29:30,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:30" (1/1) ... [2022-11-16 12:29:30,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:29:30,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:29:30,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:29:30,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:29:30,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:30" (1/1) ... [2022-11-16 12:29:30,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:29:30,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:29:30,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:29:30,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:29:30,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-16 12:29:30,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-16 12:29:30,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 12:29:30,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-11-16 12:29:30,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-16 12:29:30,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-16 12:29:30,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-16 12:29:30,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-16 12:29:30,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-16 12:29:30,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-16 12:29:30,698 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-16 12:29:30,698 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-16 12:29:30,698 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-11-16 12:29:30,699 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-11-16 12:29:30,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-16 12:29:30,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-16 12:29:30,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-16 12:29:30,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-16 12:29:30,699 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-11-16 12:29:30,700 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-11-16 12:29:30,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-16 12:29:30,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-16 12:29:30,700 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-16 12:29:30,700 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-16 12:29:30,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:29:30,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:29:30,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-16 12:29:30,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-16 12:29:30,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:29:30,701 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-16 12:29:30,702 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-16 12:29:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-16 12:29:30,702 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-16 12:29:30,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-11-16 12:29:30,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-11-16 12:29:30,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:29:30,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-16 12:29:30,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-11-16 12:29:30,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:29:30,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 12:29:30,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:29:30,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-11-16 12:29:30,704 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-16 12:29:30,704 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-16 12:29:30,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 12:29:30,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-16 12:29:30,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-11-16 12:29:30,705 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-16 12:29:30,705 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-16 12:29:30,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:29:30,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:29:31,040 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:29:31,043 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:29:31,157 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-16 12:29:36,862 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:29:36,877 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:29:36,878 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:29:36,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:29:36 BoogieIcfgContainer [2022-11-16 12:29:36,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:29:36,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:29:36,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:29:36,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:29:36,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:29:28" (1/3) ... [2022-11-16 12:29:36,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46648866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:29:36, skipping insertion in model container [2022-11-16 12:29:36,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:30" (2/3) ... [2022-11-16 12:29:36,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46648866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:29:36, skipping insertion in model container [2022-11-16 12:29:36,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:29:36" (3/3) ... [2022-11-16 12:29:36,891 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-16 12:29:36,920 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:29:36,921 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:29:37,020 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:29:37,029 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@667505cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:29:37,029 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:29:37,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 229 states, 169 states have (on average 1.3076923076923077) internal successors, (221), 180 states have internal predecessors, (221), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-11-16 12:29:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 12:29:37,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:37,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:37,047 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:29:37,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:37,055 INFO L85 PathProgramCache]: Analyzing trace with hash -709864546, now seen corresponding path program 1 times [2022-11-16 12:29:37,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:29:37,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278534235] [2022-11-16 12:29:37,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:37,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:37,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:29:37,075 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:29:37,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-16 12:29:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:37,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 12:29:37,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:29:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:29:37,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:29:37,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:29:37,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278534235] [2022-11-16 12:29:37,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278534235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:37,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:37,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:29:37,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785112169] [2022-11-16 12:29:37,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:37,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:29:37,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:29:37,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:29:37,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:29:37,537 INFO L87 Difference]: Start difference. First operand has 229 states, 169 states have (on average 1.3076923076923077) internal successors, (221), 180 states have internal predecessors, (221), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:29:37,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:29:37,595 INFO L93 Difference]: Finished difference Result 453 states and 612 transitions. [2022-11-16 12:29:37,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:29:37,598 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-11-16 12:29:37,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:29:37,609 INFO L225 Difference]: With dead ends: 453 [2022-11-16 12:29:37,609 INFO L226 Difference]: Without dead ends: 218 [2022-11-16 12:29:37,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:29:37,617 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:29:37,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:29:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-11-16 12:29:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-11-16 12:29:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 164 states have (on average 1.274390243902439) internal successors, (209), 169 states have internal predecessors, (209), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-16 12:29:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 283 transitions. [2022-11-16 12:29:37,696 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 283 transitions. Word has length 32 [2022-11-16 12:29:37,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:29:37,697 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 283 transitions. [2022-11-16 12:29:37,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:29:37,698 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 283 transitions. [2022-11-16 12:29:37,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 12:29:37,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:37,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:37,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:29:37,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:37,908 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:29:37,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:37,908 INFO L85 PathProgramCache]: Analyzing trace with hash -287162720, now seen corresponding path program 1 times [2022-11-16 12:29:37,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:29:37,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822000151] [2022-11-16 12:29:37,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:37,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:37,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:29:37,911 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:29:37,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 12:29:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:38,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:29:38,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:29:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:29:38,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:29:38,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:29:38,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822000151] [2022-11-16 12:29:38,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822000151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:38,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:38,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:29:38,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360179176] [2022-11-16 12:29:38,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:38,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:29:38,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:29:38,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:29:38,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:29:38,404 INFO L87 Difference]: Start difference. First operand 218 states and 283 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:29:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:29:38,604 INFO L93 Difference]: Finished difference Result 620 states and 808 transitions. [2022-11-16 12:29:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:29:38,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-11-16 12:29:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:29:38,614 INFO L225 Difference]: With dead ends: 620 [2022-11-16 12:29:38,614 INFO L226 Difference]: Without dead ends: 407 [2022-11-16 12:29:38,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:29:38,622 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 251 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:29:38,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 584 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:29:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-11-16 12:29:38,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2022-11-16 12:29:38,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 306 states have (on average 1.2679738562091503) internal successors, (388), 313 states have internal predecessors, (388), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-11-16 12:29:38,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 528 transitions. [2022-11-16 12:29:38,728 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 528 transitions. Word has length 32 [2022-11-16 12:29:38,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:29:38,729 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 528 transitions. [2022-11-16 12:29:38,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:29:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 528 transitions. [2022-11-16 12:29:38,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 12:29:38,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:38,733 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:38,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:29:38,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:38,947 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:29:38,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:38,948 INFO L85 PathProgramCache]: Analyzing trace with hash 86368961, now seen corresponding path program 1 times [2022-11-16 12:29:38,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:29:38,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152004191] [2022-11-16 12:29:38,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:38,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:38,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:29:38,953 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:29:38,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-16 12:29:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:39,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:29:39,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:29:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:29:39,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:29:39,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:29:39,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152004191] [2022-11-16 12:29:39,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152004191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:39,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:39,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:29:39,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075513268] [2022-11-16 12:29:39,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:39,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:29:39,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:29:39,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:29:39,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:29:39,426 INFO L87 Difference]: Start difference. First operand 407 states and 528 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-16 12:29:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:29:39,820 INFO L93 Difference]: Finished difference Result 946 states and 1256 transitions. [2022-11-16 12:29:39,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:29:39,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-11-16 12:29:39,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:29:39,825 INFO L225 Difference]: With dead ends: 946 [2022-11-16 12:29:39,825 INFO L226 Difference]: Without dead ends: 554 [2022-11-16 12:29:39,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:29:39,827 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 607 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:29:39,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1094 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:29:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-11-16 12:29:39,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 410. [2022-11-16 12:29:39,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 309 states have (on average 1.2621359223300972) internal successors, (390), 316 states have internal predecessors, (390), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-11-16 12:29:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 530 transitions. [2022-11-16 12:29:39,878 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 530 transitions. Word has length 55 [2022-11-16 12:29:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:29:39,879 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 530 transitions. [2022-11-16 12:29:39,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-16 12:29:39,880 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 530 transitions. [2022-11-16 12:29:39,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 12:29:39,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:39,882 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:39,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:29:40,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:40,096 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:29:40,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:40,097 INFO L85 PathProgramCache]: Analyzing trace with hash 766427331, now seen corresponding path program 1 times [2022-11-16 12:29:40,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:29:40,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617390662] [2022-11-16 12:29:40,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:40,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:40,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:29:40,103 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:29:40,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 12:29:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:40,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:29:40,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:29:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:29:40,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:29:40,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:29:40,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617390662] [2022-11-16 12:29:40,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617390662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:40,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:40,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:29:40,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797243013] [2022-11-16 12:29:40,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:40,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:29:40,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:29:40,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:29:40,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:29:40,664 INFO L87 Difference]: Start difference. First operand 410 states and 530 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-16 12:29:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:29:40,814 INFO L93 Difference]: Finished difference Result 1193 states and 1551 transitions. [2022-11-16 12:29:40,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:29:40,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-11-16 12:29:40,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:29:40,822 INFO L225 Difference]: With dead ends: 1193 [2022-11-16 12:29:40,822 INFO L226 Difference]: Without dead ends: 798 [2022-11-16 12:29:40,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:29:40,825 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 239 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:29:40,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 641 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:29:40,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-11-16 12:29:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 796. [2022-11-16 12:29:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 604 states have (on average 1.2566225165562914) internal successors, (759), 615 states have internal predecessors, (759), 137 states have call successors, (137), 55 states have call predecessors, (137), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-16 12:29:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1029 transitions. [2022-11-16 12:29:40,933 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1029 transitions. Word has length 55 [2022-11-16 12:29:40,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:29:40,933 INFO L495 AbstractCegarLoop]: Abstraction has 796 states and 1029 transitions. [2022-11-16 12:29:40,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-16 12:29:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1029 transitions. [2022-11-16 12:29:40,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-16 12:29:40,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:40,943 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:40,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:29:41,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:41,159 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:29:41,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:41,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2010547391, now seen corresponding path program 1 times [2022-11-16 12:29:41,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:29:41,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699313373] [2022-11-16 12:29:41,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:41,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:41,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:29:41,166 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:29:41,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-16 12:29:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:29:41,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:29:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:29:41,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:29:41,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:29:41,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699313373] [2022-11-16 12:29:41,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699313373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:41,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:41,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:29:41,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636181717] [2022-11-16 12:29:41,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:41,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:29:41,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:29:41,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:29:41,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:29:41,715 INFO L87 Difference]: Start difference. First operand 796 states and 1029 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-16 12:29:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:29:41,838 INFO L93 Difference]: Finished difference Result 798 states and 1030 transitions. [2022-11-16 12:29:41,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:29:41,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 56 [2022-11-16 12:29:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:29:41,844 INFO L225 Difference]: With dead ends: 798 [2022-11-16 12:29:41,844 INFO L226 Difference]: Without dead ends: 795 [2022-11-16 12:29:41,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:29:41,846 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 241 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:29:41,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 280 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:29:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-11-16 12:29:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2022-11-16 12:29:41,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 604 states have (on average 1.2549668874172186) internal successors, (758), 614 states have internal predecessors, (758), 136 states have call successors, (136), 55 states have call predecessors, (136), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-16 12:29:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1027 transitions. [2022-11-16 12:29:41,987 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1027 transitions. Word has length 56 [2022-11-16 12:29:41,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:29:41,990 INFO L495 AbstractCegarLoop]: Abstraction has 795 states and 1027 transitions. [2022-11-16 12:29:41,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-16 12:29:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1027 transitions. [2022-11-16 12:29:41,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 12:29:41,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:41,995 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:42,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:29:42,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:42,210 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:29:42,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:42,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2097554310, now seen corresponding path program 1 times [2022-11-16 12:29:42,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:29:42,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142886916] [2022-11-16 12:29:42,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:42,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:42,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:29:42,216 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:29:42,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 12:29:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:42,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:29:42,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:29:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:29:42,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:29:42,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:29:42,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142886916] [2022-11-16 12:29:42,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142886916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:42,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:42,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:29:42,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843056219] [2022-11-16 12:29:42,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:42,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:29:42,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:29:42,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:29:42,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:29:42,743 INFO L87 Difference]: Start difference. First operand 795 states and 1027 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-16 12:29:42,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:29:42,857 INFO L93 Difference]: Finished difference Result 797 states and 1028 transitions. [2022-11-16 12:29:42,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:29:42,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-11-16 12:29:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:29:42,862 INFO L225 Difference]: With dead ends: 797 [2022-11-16 12:29:42,862 INFO L226 Difference]: Without dead ends: 794 [2022-11-16 12:29:42,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:29:42,868 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 238 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:29:42,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 278 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:29:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-11-16 12:29:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2022-11-16 12:29:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 604 states have (on average 1.2533112582781456) internal successors, (757), 613 states have internal predecessors, (757), 135 states have call successors, (135), 55 states have call predecessors, (135), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-16 12:29:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1025 transitions. [2022-11-16 12:29:43,007 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1025 transitions. Word has length 57 [2022-11-16 12:29:43,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:29:43,007 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 1025 transitions. [2022-11-16 12:29:43,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-16 12:29:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1025 transitions. [2022-11-16 12:29:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 12:29:43,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:43,014 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:43,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-16 12:29:43,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:43,228 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:29:43,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:43,228 INFO L85 PathProgramCache]: Analyzing trace with hash 599693028, now seen corresponding path program 1 times [2022-11-16 12:29:43,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:29:43,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206923580] [2022-11-16 12:29:43,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:43,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:43,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:29:43,231 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:29:43,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-16 12:29:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:43,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:29:43,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:29:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:29:43,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:29:43,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:29:43,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206923580] [2022-11-16 12:29:43,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206923580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:43,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:43,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:29:43,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309152235] [2022-11-16 12:29:43,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:43,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:29:43,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:29:43,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:29:43,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:29:43,735 INFO L87 Difference]: Start difference. First operand 794 states and 1025 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-16 12:29:43,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:29:43,843 INFO L93 Difference]: Finished difference Result 796 states and 1026 transitions. [2022-11-16 12:29:43,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:29:43,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 58 [2022-11-16 12:29:43,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:29:43,847 INFO L225 Difference]: With dead ends: 796 [2022-11-16 12:29:43,847 INFO L226 Difference]: Without dead ends: 785 [2022-11-16 12:29:43,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:29:43,849 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 235 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:29:43,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:29:43,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2022-11-16 12:29:43,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2022-11-16 12:29:43,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 596 states have (on average 1.2516778523489933) internal successors, (746), 604 states have internal predecessors, (746), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-16 12:29:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1013 transitions. [2022-11-16 12:29:43,952 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1013 transitions. Word has length 58 [2022-11-16 12:29:43,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:29:43,952 INFO L495 AbstractCegarLoop]: Abstraction has 785 states and 1013 transitions. [2022-11-16 12:29:43,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-16 12:29:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1013 transitions. [2022-11-16 12:29:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-11-16 12:29:43,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:43,956 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:43,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:29:44,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:44,176 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:29:44,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:44,176 INFO L85 PathProgramCache]: Analyzing trace with hash -918660879, now seen corresponding path program 1 times [2022-11-16 12:29:44,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:29:44,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523475448] [2022-11-16 12:29:44,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:44,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:44,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:29:44,179 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:29:44,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-16 12:29:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:44,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:29:44,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:29:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-16 12:29:44,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:29:44,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:29:44,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523475448] [2022-11-16 12:29:44,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523475448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:44,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:44,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:29:44,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090308089] [2022-11-16 12:29:44,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:44,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:29:44,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:29:44,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:29:44,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:29:44,770 INFO L87 Difference]: Start difference. First operand 785 states and 1013 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 12:29:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:29:44,963 INFO L93 Difference]: Finished difference Result 1619 states and 2097 transitions. [2022-11-16 12:29:44,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:29:44,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 152 [2022-11-16 12:29:44,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:29:44,968 INFO L225 Difference]: With dead ends: 1619 [2022-11-16 12:29:44,969 INFO L226 Difference]: Without dead ends: 849 [2022-11-16 12:29:44,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:29:44,972 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 41 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:29:44,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 535 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:29:44,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2022-11-16 12:29:45,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 839. [2022-11-16 12:29:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 649 states have (on average 1.263482280431433) internal successors, (820), 657 states have internal predecessors, (820), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-16 12:29:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1087 transitions. [2022-11-16 12:29:45,083 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1087 transitions. Word has length 152 [2022-11-16 12:29:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:29:45,084 INFO L495 AbstractCegarLoop]: Abstraction has 839 states and 1087 transitions. [2022-11-16 12:29:45,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 12:29:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1087 transitions. [2022-11-16 12:29:45,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-16 12:29:45,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:45,087 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:45,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:29:45,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:45,308 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:29:45,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:45,308 INFO L85 PathProgramCache]: Analyzing trace with hash 738237246, now seen corresponding path program 1 times [2022-11-16 12:29:45,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:29:45,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360678234] [2022-11-16 12:29:45,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:45,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:45,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:29:45,310 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:29:45,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-16 12:29:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:45,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 12:29:45,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:29:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-16 12:29:45,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:29:45,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:29:45,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360678234] [2022-11-16 12:29:45,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360678234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:45,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:45,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:29:45,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555752510] [2022-11-16 12:29:45,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:45,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:29:45,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:29:45,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:29:45,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:29:45,931 INFO L87 Difference]: Start difference. First operand 839 states and 1087 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:29:46,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:29:46,121 INFO L93 Difference]: Finished difference Result 1687 states and 2211 transitions. [2022-11-16 12:29:46,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:29:46,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 161 [2022-11-16 12:29:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:29:46,128 INFO L225 Difference]: With dead ends: 1687 [2022-11-16 12:29:46,128 INFO L226 Difference]: Without dead ends: 867 [2022-11-16 12:29:46,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:29:46,131 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 1 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:29:46,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1088 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:29:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2022-11-16 12:29:46,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 855. [2022-11-16 12:29:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 661 states have (on average 1.2586989409984872) internal successors, (832), 669 states have internal predecessors, (832), 134 states have call successors, (134), 56 states have call predecessors, (134), 59 states have return successors, (153), 137 states have call predecessors, (153), 133 states have call successors, (153) [2022-11-16 12:29:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1119 transitions. [2022-11-16 12:29:46,243 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1119 transitions. Word has length 161 [2022-11-16 12:29:46,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:29:46,245 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 1119 transitions. [2022-11-16 12:29:46,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:29:46,245 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1119 transitions. [2022-11-16 12:29:46,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-11-16 12:29:46,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:46,252 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:46,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:29:46,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:46,468 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:29:46,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:46,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1438148746, now seen corresponding path program 1 times [2022-11-16 12:29:46,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:29:46,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539548295] [2022-11-16 12:29:46,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:46,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:46,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:29:46,470 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:29:46,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-16 12:29:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:46,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:29:46,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:29:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-16 12:29:47,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:29:47,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:29:47,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539548295] [2022-11-16 12:29:47,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539548295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:47,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:47,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:29:47,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604840127] [2022-11-16 12:29:47,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:47,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:29:47,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:29:47,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:29:47,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:29:47,058 INFO L87 Difference]: Start difference. First operand 855 states and 1119 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:29:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:29:47,289 INFO L93 Difference]: Finished difference Result 2269 states and 3048 transitions. [2022-11-16 12:29:47,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:29:47,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 167 [2022-11-16 12:29:47,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:29:47,296 INFO L225 Difference]: With dead ends: 2269 [2022-11-16 12:29:47,296 INFO L226 Difference]: Without dead ends: 1433 [2022-11-16 12:29:47,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:29:47,299 INFO L413 NwaCegarLoop]: 343 mSDtfsCounter, 333 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:29:47,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1336 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:29:47,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2022-11-16 12:29:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 867. [2022-11-16 12:29:47,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 673 states have (on average 1.2540861812778603) internal successors, (844), 681 states have internal predecessors, (844), 134 states have call successors, (134), 56 states have call predecessors, (134), 59 states have return successors, (153), 137 states have call predecessors, (153), 133 states have call successors, (153) [2022-11-16 12:29:47,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1131 transitions. [2022-11-16 12:29:47,435 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1131 transitions. Word has length 167 [2022-11-16 12:29:47,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:29:47,435 INFO L495 AbstractCegarLoop]: Abstraction has 867 states and 1131 transitions. [2022-11-16 12:29:47,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:29:47,436 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1131 transitions. [2022-11-16 12:29:47,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-16 12:29:47,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:47,440 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:47,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:29:47,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:47,655 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:29:47,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:47,656 INFO L85 PathProgramCache]: Analyzing trace with hash 297899197, now seen corresponding path program 1 times [2022-11-16 12:29:47,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:29:47,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299153148] [2022-11-16 12:29:47,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:47,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:47,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:29:47,658 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:29:47,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-16 12:29:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:48,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 12:29:48,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:29:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-16 12:29:48,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:29:48,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:29:48,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299153148] [2022-11-16 12:29:48,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299153148] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:48,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:48,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:29:48,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609054351] [2022-11-16 12:29:48,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:48,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:29:48,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:29:48,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:29:48,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:29:48,475 INFO L87 Difference]: Start difference. First operand 867 states and 1131 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 12:29:50,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:52,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:52,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:29:52,574 INFO L93 Difference]: Finished difference Result 2263 states and 3033 transitions. [2022-11-16 12:29:52,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:29:52,575 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 169 [2022-11-16 12:29:52,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:29:52,581 INFO L225 Difference]: With dead ends: 2263 [2022-11-16 12:29:52,582 INFO L226 Difference]: Without dead ends: 1415 [2022-11-16 12:29:52,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:29:52,585 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 203 mSDsluCounter, 2938 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 3323 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:29:52,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 3323 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-11-16 12:29:52,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2022-11-16 12:29:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 899. [2022-11-16 12:29:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 701 states have (on average 1.2439372325249642) internal successors, (872), 705 states have internal predecessors, (872), 134 states have call successors, (134), 56 states have call predecessors, (134), 63 states have return successors, (161), 145 states have call predecessors, (161), 133 states have call successors, (161) [2022-11-16 12:29:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1167 transitions. [2022-11-16 12:29:52,799 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1167 transitions. Word has length 169 [2022-11-16 12:29:52,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:29:52,800 INFO L495 AbstractCegarLoop]: Abstraction has 899 states and 1167 transitions. [2022-11-16 12:29:52,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 12:29:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1167 transitions. [2022-11-16 12:29:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-16 12:29:52,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:52,804 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:52,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:29:53,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:53,027 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:29:53,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:53,028 INFO L85 PathProgramCache]: Analyzing trace with hash -347768059, now seen corresponding path program 2 times [2022-11-16 12:29:53,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:29:53,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246099670] [2022-11-16 12:29:53,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:29:53,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:53,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:29:53,030 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:29:53,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-16 12:29:53,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 12:29:53,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:29:53,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:29:53,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:29:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-16 12:29:53,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:29:53,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:29:53,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246099670] [2022-11-16 12:29:53,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246099670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:53,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:53,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:29:53,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430136608] [2022-11-16 12:29:53,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:53,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:29:53,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:29:53,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:29:53,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:29:53,455 INFO L87 Difference]: Start difference. First operand 899 states and 1167 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:29:53,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:29:53,891 INFO L93 Difference]: Finished difference Result 2723 states and 3543 transitions. [2022-11-16 12:29:53,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:29:53,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 175 [2022-11-16 12:29:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:29:53,901 INFO L225 Difference]: With dead ends: 2723 [2022-11-16 12:29:53,901 INFO L226 Difference]: Without dead ends: 1843 [2022-11-16 12:29:53,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:29:53,905 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 373 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:29:53,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1745 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:29:53,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2022-11-16 12:29:54,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 935. [2022-11-16 12:29:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 729 states have (on average 1.2345679012345678) internal successors, (900), 733 states have internal predecessors, (900), 142 states have call successors, (142), 56 states have call predecessors, (142), 63 states have return successors, (169), 153 states have call predecessors, (169), 141 states have call successors, (169) [2022-11-16 12:29:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1211 transitions. [2022-11-16 12:29:54,067 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1211 transitions. Word has length 175 [2022-11-16 12:29:54,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:29:54,068 INFO L495 AbstractCegarLoop]: Abstraction has 935 states and 1211 transitions. [2022-11-16 12:29:54,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:29:54,068 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1211 transitions. [2022-11-16 12:29:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-16 12:29:54,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:54,072 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:54,092 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-16 12:29:54,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:54,288 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:29:54,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:54,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1358885309, now seen corresponding path program 1 times [2022-11-16 12:29:54,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:29:54,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404473] [2022-11-16 12:29:54,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:54,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:54,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:29:54,291 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:29:54,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-16 12:29:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:54,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 12:29:54,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:29:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-16 12:29:55,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:29:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-16 12:29:56,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:29:56,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404473] [2022-11-16 12:29:56,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404473] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:29:56,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:29:56,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-11-16 12:29:56,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344426789] [2022-11-16 12:29:56,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:29:56,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 12:29:56,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:29:56,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 12:29:56,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:29:56,228 INFO L87 Difference]: Start difference. First operand 935 states and 1211 transitions. Second operand has 16 states, 16 states have (on average 7.75) internal successors, (124), 12 states have internal predecessors, (124), 4 states have call successors, (21), 2 states have call predecessors, (21), 6 states have return successors, (23), 8 states have call predecessors, (23), 4 states have call successors, (23) [2022-11-16 12:29:58,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:00,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:02,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:04,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:05,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:30:05,090 INFO L93 Difference]: Finished difference Result 2077 states and 2718 transitions. [2022-11-16 12:30:05,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:30:05,092 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.75) internal successors, (124), 12 states have internal predecessors, (124), 4 states have call successors, (21), 2 states have call predecessors, (21), 6 states have return successors, (23), 8 states have call predecessors, (23), 4 states have call successors, (23) Word has length 175 [2022-11-16 12:30:05,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:30:05,098 INFO L225 Difference]: With dead ends: 2077 [2022-11-16 12:30:05,098 INFO L226 Difference]: Without dead ends: 1161 [2022-11-16 12:30:05,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:30:05,101 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 60 mSDsluCounter, 3444 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 3773 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:30:05,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 3773 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 4 Unknown, 0 Unchecked, 8.5s Time] [2022-11-16 12:30:05,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2022-11-16 12:30:05,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 943. [2022-11-16 12:30:05,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 733 states have (on average 1.233287858117326) internal successors, (904), 737 states have internal predecessors, (904), 146 states have call successors, (146), 56 states have call predecessors, (146), 63 states have return successors, (177), 157 states have call predecessors, (177), 145 states have call successors, (177) [2022-11-16 12:30:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1227 transitions. [2022-11-16 12:30:05,302 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1227 transitions. Word has length 175 [2022-11-16 12:30:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:30:05,302 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1227 transitions. [2022-11-16 12:30:05,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.75) internal successors, (124), 12 states have internal predecessors, (124), 4 states have call successors, (21), 2 states have call predecessors, (21), 6 states have return successors, (23), 8 states have call predecessors, (23), 4 states have call successors, (23) [2022-11-16 12:30:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1227 transitions. [2022-11-16 12:30:05,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-11-16 12:30:05,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:30:05,308 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:05,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-16 12:30:05,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:30:05,530 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:30:05,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:05,531 INFO L85 PathProgramCache]: Analyzing trace with hash -41853573, now seen corresponding path program 2 times [2022-11-16 12:30:05,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:30:05,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631206587] [2022-11-16 12:30:05,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:30:05,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:30:05,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:30:05,534 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:30:05,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-16 12:30:05,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 12:30:05,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:30:05,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 12:30:05,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:30:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-16 12:30:06,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:30:06,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:30:06,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631206587] [2022-11-16 12:30:06,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631206587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:06,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:06,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:30:06,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414518983] [2022-11-16 12:30:06,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:06,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:30:06,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:30:06,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:30:06,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:30:06,118 INFO L87 Difference]: Start difference. First operand 943 states and 1227 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:30:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:30:07,794 INFO L93 Difference]: Finished difference Result 1915 states and 2585 transitions. [2022-11-16 12:30:07,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:30:07,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 181 [2022-11-16 12:30:07,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:30:07,803 INFO L225 Difference]: With dead ends: 1915 [2022-11-16 12:30:07,803 INFO L226 Difference]: Without dead ends: 1449 [2022-11-16 12:30:07,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:30:07,806 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 569 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:30:07,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 1779 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-16 12:30:07,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2022-11-16 12:30:08,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 949. [2022-11-16 12:30:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 739 states have (on average 1.2313937753721245) internal successors, (910), 743 states have internal predecessors, (910), 146 states have call successors, (146), 56 states have call predecessors, (146), 63 states have return successors, (177), 157 states have call predecessors, (177), 145 states have call successors, (177) [2022-11-16 12:30:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1233 transitions. [2022-11-16 12:30:08,036 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1233 transitions. Word has length 181 [2022-11-16 12:30:08,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:30:08,037 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1233 transitions. [2022-11-16 12:30:08,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:30:08,037 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1233 transitions. [2022-11-16 12:30:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-11-16 12:30:08,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:30:08,043 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:08,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-16 12:30:08,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:30:08,259 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:30:08,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:08,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1599576633, now seen corresponding path program 1 times [2022-11-16 12:30:08,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:30:08,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181838659] [2022-11-16 12:30:08,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:08,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:30:08,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:30:08,261 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:30:08,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-16 12:30:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:09,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-16 12:30:09,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:30:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-16 12:30:09,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:30:09,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:30:09,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181838659] [2022-11-16 12:30:09,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181838659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:09,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:09,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:30:09,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181593025] [2022-11-16 12:30:09,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:09,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:30:09,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:30:09,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:30:09,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:30:09,591 INFO L87 Difference]: Start difference. First operand 949 states and 1233 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-16 12:30:10,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:30:10,096 INFO L93 Difference]: Finished difference Result 2273 states and 3022 transitions. [2022-11-16 12:30:10,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:30:10,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 208 [2022-11-16 12:30:10,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:30:10,108 INFO L225 Difference]: With dead ends: 2273 [2022-11-16 12:30:10,108 INFO L226 Difference]: Without dead ends: 1343 [2022-11-16 12:30:10,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:30:10,114 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 93 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:30:10,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1823 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:30:10,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-11-16 12:30:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 961. [2022-11-16 12:30:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 751 states have (on average 1.2276964047936085) internal successors, (922), 751 states have internal predecessors, (922), 146 states have call successors, (146), 56 states have call predecessors, (146), 63 states have return successors, (177), 161 states have call predecessors, (177), 145 states have call successors, (177) [2022-11-16 12:30:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1245 transitions. [2022-11-16 12:30:10,339 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1245 transitions. Word has length 208 [2022-11-16 12:30:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:30:10,340 INFO L495 AbstractCegarLoop]: Abstraction has 961 states and 1245 transitions. [2022-11-16 12:30:10,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-16 12:30:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1245 transitions. [2022-11-16 12:30:10,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-11-16 12:30:10,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:30:10,346 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:10,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-16 12:30:10,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:30:10,560 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:30:10,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:10,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1462329921, now seen corresponding path program 2 times [2022-11-16 12:30:10,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:30:10,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116573282] [2022-11-16 12:30:10,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:30:10,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:30:10,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:30:10,562 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:30:10,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-16 12:30:11,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:30:11,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:30:12,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:30:12,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:30:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 30 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-16 12:30:12,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:30:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-11-16 12:30:13,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:30:13,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116573282] [2022-11-16 12:30:13,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116573282] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:30:13,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:30:13,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-11-16 12:30:13,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700957063] [2022-11-16 12:30:13,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:30:13,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:30:13,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:30:13,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:30:13,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:30:13,181 INFO L87 Difference]: Start difference. First operand 961 states and 1245 transitions. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 4 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-11-16 12:30:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:30:16,123 INFO L93 Difference]: Finished difference Result 5664 states and 7367 transitions. [2022-11-16 12:30:16,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:30:16,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 4 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 214 [2022-11-16 12:30:16,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:30:16,156 INFO L225 Difference]: With dead ends: 5664 [2022-11-16 12:30:16,156 INFO L226 Difference]: Without dead ends: 5656 [2022-11-16 12:30:16,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:30:16,159 INFO L413 NwaCegarLoop]: 684 mSDtfsCounter, 980 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:30:16,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 1994 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-16 12:30:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5656 states. [2022-11-16 12:30:17,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5656 to 5623. [2022-11-16 12:30:17,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5623 states, 4403 states have (on average 1.2316602316602316) internal successors, (5423), 4411 states have internal predecessors, (5423), 856 states have call successors, (856), 316 states have call predecessors, (856), 363 states have return successors, (1047), 943 states have call predecessors, (1047), 855 states have call successors, (1047) [2022-11-16 12:30:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5623 states to 5623 states and 7326 transitions. [2022-11-16 12:30:17,831 INFO L78 Accepts]: Start accepts. Automaton has 5623 states and 7326 transitions. Word has length 214 [2022-11-16 12:30:17,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:30:17,832 INFO L495 AbstractCegarLoop]: Abstraction has 5623 states and 7326 transitions. [2022-11-16 12:30:17,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 4 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-11-16 12:30:17,833 INFO L276 IsEmpty]: Start isEmpty. Operand 5623 states and 7326 transitions. [2022-11-16 12:30:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-11-16 12:30:17,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:30:17,850 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:17,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-16 12:30:18,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:30:18,075 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:30:18,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:18,076 INFO L85 PathProgramCache]: Analyzing trace with hash 451212671, now seen corresponding path program 1 times [2022-11-16 12:30:18,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:30:18,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036500294] [2022-11-16 12:30:18,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:18,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:30:18,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:30:18,079 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:30:18,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-16 12:30:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:19,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 1307 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 12:30:19,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:30:19,317 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-16 12:30:19,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:30:19,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:30:19,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036500294] [2022-11-16 12:30:19,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036500294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:19,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:19,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:30:19,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091271971] [2022-11-16 12:30:19,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:19,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:30:19,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:30:19,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:30:19,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:30:19,321 INFO L87 Difference]: Start difference. First operand 5623 states and 7326 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-16 12:30:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:30:21,755 INFO L93 Difference]: Finished difference Result 12429 states and 16837 transitions. [2022-11-16 12:30:21,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:30:21,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 214 [2022-11-16 12:30:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:30:21,806 INFO L225 Difference]: With dead ends: 12429 [2022-11-16 12:30:21,807 INFO L226 Difference]: Without dead ends: 9605 [2022-11-16 12:30:21,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:30:21,817 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 292 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:30:21,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1838 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:30:21,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9605 states. [2022-11-16 12:30:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9605 to 5695. [2022-11-16 12:30:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5695 states, 4475 states have (on average 1.2279329608938547) internal successors, (5495), 4459 states have internal predecessors, (5495), 856 states have call successors, (856), 316 states have call predecessors, (856), 363 states have return successors, (1047), 967 states have call predecessors, (1047), 855 states have call successors, (1047) [2022-11-16 12:30:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5695 states to 5695 states and 7398 transitions. [2022-11-16 12:30:22,951 INFO L78 Accepts]: Start accepts. Automaton has 5695 states and 7398 transitions. Word has length 214 [2022-11-16 12:30:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:30:22,952 INFO L495 AbstractCegarLoop]: Abstraction has 5695 states and 7398 transitions. [2022-11-16 12:30:22,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-16 12:30:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 5695 states and 7398 transitions. [2022-11-16 12:30:22,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-11-16 12:30:22,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:30:22,965 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:23,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-16 12:30:23,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:30:23,179 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:30:23,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:23,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1090884807, now seen corresponding path program 2 times [2022-11-16 12:30:23,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:30:23,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740876910] [2022-11-16 12:30:23,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:30:23,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:30:23,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:30:23,182 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:30:23,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-16 12:30:23,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 12:30:23,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:30:23,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:30:23,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:30:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-11-16 12:30:23,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:30:23,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:30:23,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740876910] [2022-11-16 12:30:23,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740876910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:23,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:23,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:30:23,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958392482] [2022-11-16 12:30:23,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:23,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:30:23,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:30:23,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:30:23,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:30:23,762 INFO L87 Difference]: Start difference. First operand 5695 states and 7398 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-16 12:30:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:30:26,428 INFO L93 Difference]: Finished difference Result 18053 states and 23594 transitions. [2022-11-16 12:30:26,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:30:26,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 220 [2022-11-16 12:30:26,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:30:26,496 INFO L225 Difference]: With dead ends: 18053 [2022-11-16 12:30:26,497 INFO L226 Difference]: Without dead ends: 12377 [2022-11-16 12:30:26,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:30:26,514 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 331 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:30:26,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 939 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:30:26,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12377 states. [2022-11-16 12:30:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12377 to 5719. [2022-11-16 12:30:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5719 states, 4499 states have (on average 1.2267170482329406) internal successors, (5519), 4491 states have internal predecessors, (5519), 856 states have call successors, (856), 316 states have call predecessors, (856), 363 states have return successors, (1047), 959 states have call predecessors, (1047), 855 states have call successors, (1047) [2022-11-16 12:30:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5719 states to 5719 states and 7422 transitions. [2022-11-16 12:30:27,736 INFO L78 Accepts]: Start accepts. Automaton has 5719 states and 7422 transitions. Word has length 220 [2022-11-16 12:30:27,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:30:27,737 INFO L495 AbstractCegarLoop]: Abstraction has 5719 states and 7422 transitions. [2022-11-16 12:30:27,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-16 12:30:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 5719 states and 7422 transitions. [2022-11-16 12:30:27,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-11-16 12:30:27,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:30:27,750 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:27,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-16 12:30:27,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:30:27,963 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:30:27,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:27,964 INFO L85 PathProgramCache]: Analyzing trace with hash -860196191, now seen corresponding path program 1 times [2022-11-16 12:30:27,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:30:27,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302632661] [2022-11-16 12:30:27,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:27,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:30:27,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:30:27,966 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:30:27,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-16 12:30:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:29,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 12:30:29,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:30:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-11-16 12:30:29,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:30:29,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:30:29,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302632661] [2022-11-16 12:30:29,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [302632661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:29,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:29,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:30:29,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954478251] [2022-11-16 12:30:29,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:29,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:30:29,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:30:29,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:30:29,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:30:29,317 INFO L87 Difference]: Start difference. First operand 5719 states and 7422 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-16 12:30:30,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:30:30,821 INFO L93 Difference]: Finished difference Result 11467 states and 14873 transitions. [2022-11-16 12:30:30,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:30:30,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 227 [2022-11-16 12:30:30,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:30:30,846 INFO L225 Difference]: With dead ends: 11467 [2022-11-16 12:30:30,846 INFO L226 Difference]: Without dead ends: 5719 [2022-11-16 12:30:30,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:30:30,865 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:30:30,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1081 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:30:30,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5719 states. [2022-11-16 12:30:32,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5719 to 5719. [2022-11-16 12:30:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5719 states, 4499 states have (on average 1.2267170482329406) internal successors, (5519), 4491 states have internal predecessors, (5519), 856 states have call successors, (856), 316 states have call predecessors, (856), 363 states have return successors, (1023), 959 states have call predecessors, (1023), 855 states have call successors, (1023) [2022-11-16 12:30:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5719 states to 5719 states and 7398 transitions. [2022-11-16 12:30:32,214 INFO L78 Accepts]: Start accepts. Automaton has 5719 states and 7398 transitions. Word has length 227 [2022-11-16 12:30:32,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:30:32,215 INFO L495 AbstractCegarLoop]: Abstraction has 5719 states and 7398 transitions. [2022-11-16 12:30:32,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-16 12:30:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 5719 states and 7398 transitions. [2022-11-16 12:30:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-11-16 12:30:32,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:30:32,228 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:32,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-16 12:30:32,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:30:32,452 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:30:32,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:32,452 INFO L85 PathProgramCache]: Analyzing trace with hash -84677671, now seen corresponding path program 1 times [2022-11-16 12:30:32,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:30:32,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400595836] [2022-11-16 12:30:32,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:32,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:30:32,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:30:32,460 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:30:32,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-16 12:30:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:37,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 1355 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-16 12:30:37,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:30:37,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:30:37,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-16 12:30:37,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-16 12:30:37,952 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2229 (Array (_ BitVec 64) (_ BitVec 8)))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2229))) is different from true [2022-11-16 12:30:37,985 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc64.base| (_ BitVec 64))) (and (exists ((v_ArrVal_2229 (Array (_ BitVec 64) (_ BitVec 8)))) (= |c_#memory_int| (store |c_old(#memory_int)| |ldv_init_zalloc_#t~malloc64.base| v_ArrVal_2229))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_init_zalloc_#t~malloc64.base|)) (exists ((v_ArrVal_2228 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc64.base| v_ArrVal_2228))))) is different from true [2022-11-16 12:30:38,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-16 12:30:38,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:30:38,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:30:38,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:30:38,129 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:30:38,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 12:30:38,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-16 12:30:42,461 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_1| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_1|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) (exists ((ldv_malloc_~p~0.base (_ BitVec 64))) (= (store |c_old(#valid)| ldv_malloc_~p~0.base (_ bv1 1)) |c_#valid|))) is different from true [2022-11-16 12:30:42,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 12:30:48,648 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_1| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_1|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) (exists ((ldv_malloc_~p~0.base (_ BitVec 64))) (= (bvadd (select |c_#valid| ldv_malloc_~p~0.base) (_ bv1 1)) (_ bv0 1))) (exists ((ldv_malloc_~p~0.base (_ BitVec 64))) (= (store |c_old(#valid)| ldv_malloc_~p~0.base (_ bv1 1)) |c_#valid|))) is different from true [2022-11-16 12:30:48,718 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 12:30:48,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 12:30:49,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-16 12:30:53,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-16 12:31:08,518 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:31:08,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 12:31:08,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 12:31:15,136 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_1| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_1|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-16 12:31:25,853 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-16 12:31:25,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-16 12:31:28,429 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_6| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_6|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-16 12:31:28,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:31:30,818 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_7| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_7|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-16 12:31:31,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:31:31,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:31:33,442 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_8| (_ BitVec 64))) (= ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)) (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_8|))) is different from true [2022-11-16 12:31:33,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:31:33,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 12:31:33,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:31:33,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 110 [2022-11-16 12:31:33,850 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 86 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 105 not checked. [2022-11-16 12:31:33,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:31:33,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ BitVec 64)) (v_ArrVal_2240 (Array (_ BitVec 64) (_ BitVec 8)))) (= (_ bv0 64) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2240) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|))) (concat (concat (concat (concat (concat (concat (concat (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv23 64))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv22 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv21 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv20 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv19 64)))) (select .cse0 (bvadd (_ bv18 64) |ULTIMATE.start_usb_acecad_probe_~id#1.offset|))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv17 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv16 64))))))) is different from false [2022-11-16 12:31:34,010 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2240 (Array (_ BitVec 64) (_ BitVec 8))) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ BitVec 64))) (= (_ bv0 64) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2240) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|))) (concat (concat (concat (concat (concat (concat (concat (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv23 64))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv22 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv21 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv20 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv19 64)))) (select .cse0 (bvadd (_ bv18 64) |ULTIMATE.start_usb_acecad_probe_~id#1.offset|))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv17 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv16 64))))))) is different from false [2022-11-16 12:31:34,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:31:34,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400595836] [2022-11-16 12:31:34,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400595836] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:31:34,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1366705044] [2022-11-16 12:31:34,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:31:34,087 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:31:34,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:31:34,095 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:31:34,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fe279c1-776a-4aac-8db2-55cc3b453d70/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process