./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--misc--idmouse.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 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_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--misc--idmouse.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --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 57ba9a4d546a973620a0029f54a814a104db676a0fd0f250dd5545a7c0f94302 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:22:39,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:22:39,602 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-12 02:22:39,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:22:39,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:22:39,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:22:39,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:22:39,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:22:39,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:22:39,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:22:39,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:22:39,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:22:39,645 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:22:39,645 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:22:39,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:22:39,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:22:39,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:22:39,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:22:39,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:22:39,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:22:39,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:22:39,650 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:22:39,651 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:22:39,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:22:39,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:22:39,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:22:39,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:22:39,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:22:39,654 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:22:39,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:22:39,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:22:39,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:22:39,657 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:22:39,657 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:22:39,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:22:39,658 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:22:39,659 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl/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_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 57ba9a4d546a973620a0029f54a814a104db676a0fd0f250dd5545a7c0f94302 [2023-11-12 02:22:39,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:22:39,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:22:39,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:22:39,954 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:22:39,955 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:22:39,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--misc--idmouse.ko-entry_point.cil.out.i [2023-11-12 02:22:43,059 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:22:43,585 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:22:43,588 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--misc--idmouse.ko-entry_point.cil.out.i [2023-11-12 02:22:43,633 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl/data/9eae51eca/b06fed964c4f4d709dfb8103e71ae503/FLAGbfdd4653c [2023-11-12 02:22:43,651 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl/data/9eae51eca/b06fed964c4f4d709dfb8103e71ae503 [2023-11-12 02:22:43,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:22:43,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:22:43,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:22:43,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:22:43,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:22:43,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:22:43" (1/1) ... [2023-11-12 02:22:43,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b77dd27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:22:43, skipping insertion in model container [2023-11-12 02:22:43,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:22:43" (1/1) ... [2023-11-12 02:22:43,763 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:22:44,508 WARN L240 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_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--misc--idmouse.ko-entry_point.cil.out.i[101600,101613] [2023-11-12 02:22:44,792 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:22:44,828 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:22:44,912 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [3429-3430] [2023-11-12 02:22:44,915 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [3444] [2023-11-12 02:22:44,916 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3447] [2023-11-12 02:22:44,916 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3450] [2023-11-12 02:22:44,917 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3453] [2023-11-12 02:22:44,927 WARN L240 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_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--misc--idmouse.ko-entry_point.cil.out.i[101600,101613] [2023-11-12 02:22:45,026 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:22:45,082 WARN L672 CHandler]: The function __bad_percpu_size is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:22:45,091 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:22:45,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:22:45 WrapperNode [2023-11-12 02:22:45,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:22:45,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:22:45,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:22:45,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:22:45,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:22:45" (1/1) ... [2023-11-12 02:22:45,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:22:45" (1/1) ... [2023-11-12 02:22:45,242 INFO L138 Inliner]: procedures = 113, calls = 447, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 1299 [2023-11-12 02:22:45,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:22:45,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:22:45,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:22:45,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:22:45,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:22:45" (1/1) ... [2023-11-12 02:22:45,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:22:45" (1/1) ... [2023-11-12 02:22:45,272 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:22:45" (1/1) ... [2023-11-12 02:22:45,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:22:45" (1/1) ... [2023-11-12 02:22:45,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:22:45" (1/1) ... [2023-11-12 02:22:45,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:22:45" (1/1) ... [2023-11-12 02:22:45,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:22:45" (1/1) ... [2023-11-12 02:22:45,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:22:45" (1/1) ... [2023-11-12 02:22:45,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:22:45,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:22:45,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:22:45,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:22:45,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:22:45" (1/1) ... [2023-11-12 02:22:45,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:22:45,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:22:45,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:22:45,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:22:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-12 02:22:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2023-11-12 02:22:45,490 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2023-11-12 02:22:45,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-12 02:22:45,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-12 02:22:45,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-12 02:22:45,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-12 02:22:45,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:22:45,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2023-11-12 02:22:45,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2023-11-12 02:22:45,495 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2023-11-12 02:22:45,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2023-11-12 02:22:45,495 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-12 02:22:45,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-12 02:22:45,496 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-12 02:22:45,496 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-12 02:22:45,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:22:45,496 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2023-11-12 02:22:45,496 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2023-11-12 02:22:45,497 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-12 02:22:45,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-12 02:22:45,497 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-12 02:22:45,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-12 02:22:45,498 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:22:45,498 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:22:45,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 02:22:45,498 INFO L130 BoogieDeclarations]: Found specification of procedure idmouse_resume [2023-11-12 02:22:45,499 INFO L138 BoogieDeclarations]: Found implementation of procedure idmouse_resume [2023-11-12 02:22:45,500 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2023-11-12 02:22:45,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2023-11-12 02:22:45,500 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_2 [2023-11-12 02:22:45,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_2 [2023-11-12 02:22:45,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:22:45,501 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-12 02:22:45,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-12 02:22:45,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 02:22:45,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:22:45,502 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2023-11-12 02:22:45,502 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_5 [2023-11-12 02:22:45,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_5 [2023-11-12 02:22:45,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 02:22:45,503 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2023-11-12 02:22:45,503 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2023-11-12 02:22:45,503 INFO L130 BoogieDeclarations]: Found specification of procedure idmouse_disconnect [2023-11-12 02:22:45,503 INFO L138 BoogieDeclarations]: Found implementation of procedure idmouse_disconnect [2023-11-12 02:22:45,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:22:45,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 02:22:45,504 INFO L130 BoogieDeclarations]: Found specification of procedure idmouse_delete [2023-11-12 02:22:45,504 INFO L138 BoogieDeclarations]: Found implementation of procedure idmouse_delete [2023-11-12 02:22:45,504 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2023-11-12 02:22:45,504 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2023-11-12 02:22:45,504 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2023-11-12 02:22:45,504 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2023-11-12 02:22:45,505 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2023-11-12 02:22:45,505 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2023-11-12 02:22:45,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:22:45,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2023-11-12 02:22:45,505 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2023-11-12 02:22:45,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2023-11-12 02:22:45,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:22:45,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:22:45,984 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:22:46,007 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:22:46,156 INFO L770 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-12 02:22:46,382 INFO L770 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2023-11-12 02:22:47,414 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:22:47,426 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:22:47,427 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:22:47,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:22:47 BoogieIcfgContainer [2023-11-12 02:22:47,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:22:47,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:22:47,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:22:47,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:22:47,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:22:43" (1/3) ... [2023-11-12 02:22:47,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62154445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:22:47, skipping insertion in model container [2023-11-12 02:22:47,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:22:45" (2/3) ... [2023-11-12 02:22:47,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62154445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:22:47, skipping insertion in model container [2023-11-12 02:22:47,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:22:47" (3/3) ... [2023-11-12 02:22:47,440 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--usb--misc--idmouse.ko-entry_point.cil.out.i [2023-11-12 02:22:47,462 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:22:47,462 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:22:47,528 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:22:47,535 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=LoopHeads, 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;@733f657f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:22:47,536 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:22:47,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 382 states, 273 states have (on average 1.3736263736263736) internal successors, (375), 288 states have internal predecessors, (375), 87 states have call successors, (87), 22 states have call predecessors, (87), 20 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2023-11-12 02:22:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-12 02:22:47,562 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:22:47,562 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:22:47,563 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:22:47,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:22:47,569 INFO L85 PathProgramCache]: Analyzing trace with hash 153377320, now seen corresponding path program 1 times [2023-11-12 02:22:47,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:22:47,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783193893] [2023-11-12 02:22:47,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:22:47,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:22:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:48,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:22:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:48,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:22:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:48,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-12 02:22:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 02:22:48,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:22:48,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783193893] [2023-11-12 02:22:48,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783193893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:22:48,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:22:48,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:22:48,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413823434] [2023-11-12 02:22:48,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:22:48,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:22:48,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:22:48,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:22:48,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:22:48,435 INFO L87 Difference]: Start difference. First operand has 382 states, 273 states have (on average 1.3736263736263736) internal successors, (375), 288 states have internal predecessors, (375), 87 states have call successors, (87), 22 states have call predecessors, (87), 20 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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) [2023-11-12 02:22:49,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:22:49,794 INFO L93 Difference]: Finished difference Result 1122 states and 1625 transitions. [2023-11-12 02:22:49,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:22:49,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 36 [2023-11-12 02:22:49,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:22:49,829 INFO L225 Difference]: With dead ends: 1122 [2023-11-12 02:22:49,829 INFO L226 Difference]: Without dead ends: 723 [2023-11-12 02:22:49,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:22:49,849 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 527 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:22:49,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1134 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-12 02:22:49,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2023-11-12 02:22:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 696. [2023-11-12 02:22:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 507 states have (on average 1.3412228796844181) internal successors, (680), 516 states have internal predecessors, (680), 150 states have call successors, (150), 39 states have call predecessors, (150), 38 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144) [2023-11-12 02:22:49,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 974 transitions. [2023-11-12 02:22:49,998 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 974 transitions. Word has length 36 [2023-11-12 02:22:49,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:22:49,999 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 974 transitions. [2023-11-12 02:22:49,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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) [2023-11-12 02:22:49,999 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 974 transitions. [2023-11-12 02:22:50,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-12 02:22:50,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:22:50,004 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:22:50,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:22:50,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:22:50,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:22:50,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1122525003, now seen corresponding path program 1 times [2023-11-12 02:22:50,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:22:50,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117940162] [2023-11-12 02:22:50,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:22:50,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:22:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:50,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:22:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:50,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:22:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:50,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-12 02:22:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:50,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-12 02:22:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-12 02:22:50,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:22:50,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117940162] [2023-11-12 02:22:50,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117940162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:22:50,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:22:50,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:22:50,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524432822] [2023-11-12 02:22:50,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:22:50,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:22:50,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:22:50,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:22:50,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:22:50,562 INFO L87 Difference]: Start difference. First operand 696 states and 974 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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) [2023-11-12 02:22:51,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:22:51,328 INFO L93 Difference]: Finished difference Result 722 states and 1015 transitions. [2023-11-12 02:22:51,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:22:51,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 46 [2023-11-12 02:22:51,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:22:51,340 INFO L225 Difference]: With dead ends: 722 [2023-11-12 02:22:51,340 INFO L226 Difference]: Without dead ends: 719 [2023-11-12 02:22:51,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:22:51,347 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 486 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:22:51,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 705 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:22:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2023-11-12 02:22:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 695. [2023-11-12 02:22:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 507 states have (on average 1.339250493096647) internal successors, (679), 515 states have internal predecessors, (679), 149 states have call successors, (149), 39 states have call predecessors, (149), 38 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144) [2023-11-12 02:22:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 972 transitions. [2023-11-12 02:22:51,468 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 972 transitions. Word has length 46 [2023-11-12 02:22:51,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:22:51,470 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 972 transitions. [2023-11-12 02:22:51,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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) [2023-11-12 02:22:51,471 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 972 transitions. [2023-11-12 02:22:51,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-12 02:22:51,482 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:22:51,482 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:22:51,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:22:51,483 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:22:51,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:22:51,484 INFO L85 PathProgramCache]: Analyzing trace with hash 438319802, now seen corresponding path program 1 times [2023-11-12 02:22:51,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:22:51,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21707869] [2023-11-12 02:22:51,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:22:51,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:22:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:51,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:22:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:51,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:22:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:51,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-12 02:22:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:51,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-12 02:22:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-12 02:22:51,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:22:51,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21707869] [2023-11-12 02:22:51,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21707869] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:22:51,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:22:51,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:22:51,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956157511] [2023-11-12 02:22:51,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:22:51,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:22:51,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:22:51,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:22:51,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:22:51,901 INFO L87 Difference]: Start difference. First operand 695 states and 972 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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) [2023-11-12 02:22:52,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:22:52,621 INFO L93 Difference]: Finished difference Result 721 states and 1013 transitions. [2023-11-12 02:22:52,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:22:52,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 47 [2023-11-12 02:22:52,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:22:52,627 INFO L225 Difference]: With dead ends: 721 [2023-11-12 02:22:52,627 INFO L226 Difference]: Without dead ends: 718 [2023-11-12 02:22:52,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:22:52,631 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 483 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:22:52,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 702 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:22:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2023-11-12 02:22:52,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 694. [2023-11-12 02:22:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 507 states have (on average 1.3372781065088757) internal successors, (678), 514 states have internal predecessors, (678), 148 states have call successors, (148), 39 states have call predecessors, (148), 38 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144) [2023-11-12 02:22:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 970 transitions. [2023-11-12 02:22:52,720 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 970 transitions. Word has length 47 [2023-11-12 02:22:52,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:22:52,722 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 970 transitions. [2023-11-12 02:22:52,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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) [2023-11-12 02:22:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 970 transitions. [2023-11-12 02:22:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-12 02:22:52,724 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:22:52,724 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:22:52,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:22:52,729 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:22:52,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:22:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash 702799918, now seen corresponding path program 1 times [2023-11-12 02:22:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:22:52,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953737388] [2023-11-12 02:22:52,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:22:52,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:22:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:52,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:22:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:52,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:22:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:52,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-12 02:22:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:52,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-12 02:22:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-12 02:22:52,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:22:52,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953737388] [2023-11-12 02:22:52,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953737388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:22:52,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:22:52,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:22:52,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621335960] [2023-11-12 02:22:52,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:22:52,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:22:52,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:22:52,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:22:52,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:22:52,950 INFO L87 Difference]: Start difference. First operand 694 states and 970 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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) [2023-11-12 02:22:53,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:22:53,626 INFO L93 Difference]: Finished difference Result 720 states and 1011 transitions. [2023-11-12 02:22:53,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:22:53,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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 48 [2023-11-12 02:22:53,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:22:53,633 INFO L225 Difference]: With dead ends: 720 [2023-11-12 02:22:53,633 INFO L226 Difference]: Without dead ends: 717 [2023-11-12 02:22:53,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:22:53,635 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 480 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:22:53,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 699 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:22:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2023-11-12 02:22:53,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 693. [2023-11-12 02:22:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 507 states have (on average 1.3353057199211045) internal successors, (677), 513 states have internal predecessors, (677), 147 states have call successors, (147), 39 states have call predecessors, (147), 38 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144) [2023-11-12 02:22:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 968 transitions. [2023-11-12 02:22:53,734 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 968 transitions. Word has length 48 [2023-11-12 02:22:53,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:22:53,735 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 968 transitions. [2023-11-12 02:22:53,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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) [2023-11-12 02:22:53,735 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 968 transitions. [2023-11-12 02:22:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-12 02:22:53,737 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:22:53,737 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:22:53,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:22:53,738 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:22:53,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:22:53,738 INFO L85 PathProgramCache]: Analyzing trace with hash 311753789, now seen corresponding path program 1 times [2023-11-12 02:22:53,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:22:53,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838322660] [2023-11-12 02:22:53,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:22:53,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:22:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:53,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:22:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:53,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:22:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:53,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-12 02:22:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:53,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-12 02:22:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-12 02:22:53,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:22:53,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838322660] [2023-11-12 02:22:53,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838322660] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:22:53,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:22:53,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:22:53,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707201360] [2023-11-12 02:22:53,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:22:53,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:22:53,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:22:53,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:22:53,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:22:53,906 INFO L87 Difference]: Start difference. First operand 693 states and 968 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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) [2023-11-12 02:22:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:22:55,113 INFO L93 Difference]: Finished difference Result 2096 states and 2942 transitions. [2023-11-12 02:22:55,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:22:55,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 49 [2023-11-12 02:22:55,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:22:55,123 INFO L225 Difference]: With dead ends: 2096 [2023-11-12 02:22:55,124 INFO L226 Difference]: Without dead ends: 1414 [2023-11-12 02:22:55,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:22:55,127 INFO L413 NwaCegarLoop]: 568 mSDtfsCounter, 508 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:22:55,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1267 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-12 02:22:55,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2023-11-12 02:22:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1362. [2023-11-12 02:22:55,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 997 states have (on average 1.337011033099298) internal successors, (1333), 1007 states have internal predecessors, (1333), 288 states have call successors, (288), 77 states have call predecessors, (288), 76 states have return successors, (285), 277 states have call predecessors, (285), 285 states have call successors, (285) [2023-11-12 02:22:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1906 transitions. [2023-11-12 02:22:55,250 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1906 transitions. Word has length 49 [2023-11-12 02:22:55,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:22:55,251 INFO L495 AbstractCegarLoop]: Abstraction has 1362 states and 1906 transitions. [2023-11-12 02:22:55,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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) [2023-11-12 02:22:55,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1906 transitions. [2023-11-12 02:22:55,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-12 02:22:55,254 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:22:55,255 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:22:55,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:22:55,255 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:22:55,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:22:55,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1074230545, now seen corresponding path program 1 times [2023-11-12 02:22:55,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:22:55,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873978541] [2023-11-12 02:22:55,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:22:55,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:22:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:55,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:22:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:55,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:22:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:55,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-12 02:22:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:55,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-12 02:22:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-12 02:22:55,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:22:55,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873978541] [2023-11-12 02:22:55,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873978541] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:22:55,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:22:55,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:22:55,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562222350] [2023-11-12 02:22:55,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:22:55,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:22:55,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:22:55,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:22:55,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:22:55,458 INFO L87 Difference]: Start difference. First operand 1362 states and 1906 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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) [2023-11-12 02:22:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:22:56,242 INFO L93 Difference]: Finished difference Result 1412 states and 1984 transitions. [2023-11-12 02:22:56,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:22:56,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 50 [2023-11-12 02:22:56,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:22:56,254 INFO L225 Difference]: With dead ends: 1412 [2023-11-12 02:22:56,254 INFO L226 Difference]: Without dead ends: 1400 [2023-11-12 02:22:56,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:22:56,256 INFO L413 NwaCegarLoop]: 439 mSDtfsCounter, 476 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:22:56,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 698 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:22:56,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2023-11-12 02:22:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1352. [2023-11-12 02:22:56,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 988 states have (on average 1.3360323886639676) internal successors, (1320), 997 states have internal predecessors, (1320), 287 states have call successors, (287), 77 states have call predecessors, (287), 76 states have return successors, (285), 277 states have call predecessors, (285), 285 states have call successors, (285) [2023-11-12 02:22:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1892 transitions. [2023-11-12 02:22:56,409 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1892 transitions. Word has length 50 [2023-11-12 02:22:56,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:22:56,409 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 1892 transitions. [2023-11-12 02:22:56,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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) [2023-11-12 02:22:56,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1892 transitions. [2023-11-12 02:22:56,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-12 02:22:56,414 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:22:56,415 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-11-12 02:22:56,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:22:56,415 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:22:56,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:22:56,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2071218089, now seen corresponding path program 1 times [2023-11-12 02:22:56,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:22:56,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600715540] [2023-11-12 02:22:56,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:22:56,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:22:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:56,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:22:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:56,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:22:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:56,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-12 02:22:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:56,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:22:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:56,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-12 02:22:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:56,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-12 02:22:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:56,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:22:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:56,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:22:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:56,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-12 02:22:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:56,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:22:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:56,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:22:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-12 02:22:56,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:22:56,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600715540] [2023-11-12 02:22:56,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600715540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:22:56,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:22:56,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:22:56,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442986213] [2023-11-12 02:22:56,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:22:56,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:22:56,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:22:56,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:22:56,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:22:56,703 INFO L87 Difference]: Start difference. First operand 1352 states and 1892 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-12 02:22:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:22:57,882 INFO L93 Difference]: Finished difference Result 3467 states and 4807 transitions. [2023-11-12 02:22:57,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:22:57,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2023-11-12 02:22:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:22:57,897 INFO L225 Difference]: With dead ends: 3467 [2023-11-12 02:22:57,897 INFO L226 Difference]: Without dead ends: 2126 [2023-11-12 02:22:57,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:22:57,903 INFO L413 NwaCegarLoop]: 439 mSDtfsCounter, 323 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-12 02:22:57,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1353 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-12 02:22:57,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2023-11-12 02:22:58,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2005. [2023-11-12 02:22:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 1465 states have (on average 1.3242320819112627) internal successors, (1940), 1478 states have internal predecessors, (1940), 408 states have call successors, (408), 132 states have call predecessors, (408), 131 states have return successors, (406), 394 states have call predecessors, (406), 406 states have call successors, (406) [2023-11-12 02:22:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2754 transitions. [2023-11-12 02:22:58,079 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2754 transitions. Word has length 107 [2023-11-12 02:22:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:22:58,079 INFO L495 AbstractCegarLoop]: Abstraction has 2005 states and 2754 transitions. [2023-11-12 02:22:58,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-12 02:22:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2754 transitions. [2023-11-12 02:22:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-12 02:22:58,085 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:22:58,085 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 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] [2023-11-12 02:22:58,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:22:58,086 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:22:58,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:22:58,086 INFO L85 PathProgramCache]: Analyzing trace with hash -810737814, now seen corresponding path program 1 times [2023-11-12 02:22:58,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:22:58,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812231029] [2023-11-12 02:22:58,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:22:58,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:22:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:58,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:22:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:58,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:22:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:58,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-12 02:22:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:58,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-12 02:22:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:58,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:22:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:58,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:22:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:58,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-12 02:22:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:58,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:22:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:58,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-12 02:22:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:58,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:22:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:58,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:22:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:58,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:22:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:58,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-12 02:22:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-11-12 02:22:58,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:22:58,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812231029] [2023-11-12 02:22:58,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812231029] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:22:58,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846778680] [2023-11-12 02:22:58,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:22:58,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:22:58,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:22:58,475 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:22:58,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:22:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:22:58,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-12 02:22:58,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:22:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-12 02:22:59,113 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:22:59,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846778680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:22:59,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 02:22:59,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-11-12 02:22:59,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224660609] [2023-11-12 02:22:59,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:22:59,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:22:59,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:22:59,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:22:59,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:22:59,117 INFO L87 Difference]: Start difference. First operand 2005 states and 2754 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-12 02:22:59,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:22:59,832 INFO L93 Difference]: Finished difference Result 5984 states and 8220 transitions. [2023-11-12 02:22:59,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:22:59,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2023-11-12 02:22:59,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:22:59,871 INFO L225 Difference]: With dead ends: 5984 [2023-11-12 02:22:59,872 INFO L226 Difference]: Without dead ends: 5973 [2023-11-12 02:22:59,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:22:59,876 INFO L413 NwaCegarLoop]: 977 mSDtfsCounter, 898 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:22:59,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 1801 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:22:59,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2023-11-12 02:23:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 5925. [2023-11-12 02:23:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5925 states, 4321 states have (on average 1.3283962045822726) internal successors, (5740), 4382 states have internal predecessors, (5740), 1212 states have call successors, (1212), 392 states have call predecessors, (1212), 391 states have return successors, (1210), 1150 states have call predecessors, (1210), 1210 states have call successors, (1210) [2023-11-12 02:23:00,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5925 states to 5925 states and 8162 transitions. [2023-11-12 02:23:00,436 INFO L78 Accepts]: Start accepts. Automaton has 5925 states and 8162 transitions. Word has length 129 [2023-11-12 02:23:00,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:00,437 INFO L495 AbstractCegarLoop]: Abstraction has 5925 states and 8162 transitions. [2023-11-12 02:23:00,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-12 02:23:00,437 INFO L276 IsEmpty]: Start isEmpty. Operand 5925 states and 8162 transitions. [2023-11-12 02:23:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-12 02:23:00,451 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:00,451 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 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] [2023-11-12 02:23:00,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-12 02:23:00,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2106d73a-e1e6-4a2b-a92f-1fb7d089a0d8/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:23:00,660 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:00,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:00,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1895881580, now seen corresponding path program 1 times [2023-11-12 02:23:00,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:00,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882569090] [2023-11-12 02:23:00,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:00,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:01,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:23:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:23:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:01,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-12 02:23:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:01,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-12 02:23:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:01,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:01,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:01,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-12 02:23:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:01,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:23:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:01,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-12 02:23:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:01,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:23:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:01,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:23:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:01,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:23:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:01,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-12 02:23:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-11-12 02:23:01,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:01,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882569090] [2023-11-12 02:23:01,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882569090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:01,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:01,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:23:01,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406193844] [2023-11-12 02:23:01,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:01,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:23:01,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:01,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:23:01,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:23:01,450 INFO L87 Difference]: Start difference. First operand 5925 states and 8162 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-12 02:23:03,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:03,558 INFO L93 Difference]: Finished difference Result 14911 states and 21201 transitions. [2023-11-12 02:23:03,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:23:03,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2023-11-12 02:23:03,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:03,621 INFO L225 Difference]: With dead ends: 14911 [2023-11-12 02:23:03,621 INFO L226 Difference]: Without dead ends: 9004 [2023-11-12 02:23:03,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:23:03,639 INFO L413 NwaCegarLoop]: 661 mSDtfsCounter, 233 mSDsluCounter, 2998 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 3659 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:03,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 3659 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-12 02:23:03,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9004 states. [2023-11-12 02:23:04,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9004 to 5985. [2023-11-12 02:23:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5985 states, 4369 states have (on average 1.3247882810711833) internal successors, (5788), 4430 states have internal predecessors, (5788), 1212 states have call successors, (1212), 392 states have call predecessors, (1212), 403 states have return successors, (1246), 1162 states have call predecessors, (1246), 1210 states have call successors, (1246) [2023-11-12 02:23:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5985 states to 5985 states and 8246 transitions. [2023-11-12 02:23:04,444 INFO L78 Accepts]: Start accepts. Automaton has 5985 states and 8246 transitions. Word has length 129 [2023-11-12 02:23:04,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:04,445 INFO L495 AbstractCegarLoop]: Abstraction has 5985 states and 8246 transitions. [2023-11-12 02:23:04,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-12 02:23:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 5985 states and 8246 transitions. [2023-11-12 02:23:04,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-12 02:23:04,464 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:04,464 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 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] [2023-11-12 02:23:04,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:23:04,465 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:04,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:04,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1080095380, now seen corresponding path program 1 times [2023-11-12 02:23:04,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:04,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850156049] [2023-11-12 02:23:04,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:04,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:05,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:23:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:05,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:23:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:05,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-12 02:23:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:05,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-12 02:23:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:05,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:05,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:05,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-12 02:23:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:05,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:23:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:05,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:23:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:05,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-12 02:23:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:05,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-12 02:23:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:05,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:23:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:05,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:23:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:05,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-12 02:23:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-11-12 02:23:05,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:05,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850156049] [2023-11-12 02:23:05,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850156049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:05,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:05,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 02:23:05,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90606789] [2023-11-12 02:23:05,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:05,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:23:05,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:05,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:23:05,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:23:05,353 INFO L87 Difference]: Start difference. First operand 5985 states and 8246 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-12 02:23:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:07,510 INFO L93 Difference]: Finished difference Result 14267 states and 19686 transitions. [2023-11-12 02:23:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:23:07,511 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 135 [2023-11-12 02:23:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:07,576 INFO L225 Difference]: With dead ends: 14267 [2023-11-12 02:23:07,576 INFO L226 Difference]: Without dead ends: 8300 [2023-11-12 02:23:07,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2023-11-12 02:23:07,596 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 387 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:07,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 2480 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-12 02:23:07,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8300 states. [2023-11-12 02:23:08,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8300 to 7878. [2023-11-12 02:23:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7878 states, 5812 states have (on average 1.3282863041982107) internal successors, (7720), 5907 states have internal predecessors, (7720), 1533 states have call successors, (1533), 527 states have call predecessors, (1533), 532 states have return successors, (1585), 1443 states have call predecessors, (1585), 1531 states have call successors, (1585) [2023-11-12 02:23:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7878 states to 7878 states and 10838 transitions. [2023-11-12 02:23:08,379 INFO L78 Accepts]: Start accepts. Automaton has 7878 states and 10838 transitions. Word has length 135 [2023-11-12 02:23:08,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:08,380 INFO L495 AbstractCegarLoop]: Abstraction has 7878 states and 10838 transitions. [2023-11-12 02:23:08,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-12 02:23:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 7878 states and 10838 transitions. [2023-11-12 02:23:08,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-11-12 02:23:08,406 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:08,406 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 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] [2023-11-12 02:23:08,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:23:08,407 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:08,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:08,408 INFO L85 PathProgramCache]: Analyzing trace with hash 475996142, now seen corresponding path program 1 times [2023-11-12 02:23:08,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:08,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555185809] [2023-11-12 02:23:08,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:08,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:23:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:23:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-12 02:23:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-12 02:23:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:23:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:23:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:23:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:23:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:23:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-12 02:23:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:23:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:23:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:23:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-12 02:23:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:23:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-12 02:23:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-12 02:23:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-12 02:23:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-12 02:23:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-12 02:23:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-12 02:23:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:08,777 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-11-12 02:23:08,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:08,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555185809] [2023-11-12 02:23:08,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555185809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:08,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:08,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:23:08,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702509518] [2023-11-12 02:23:08,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:08,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:23:08,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:08,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:23:08,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:23:08,781 INFO L87 Difference]: Start difference. First operand 7878 states and 10838 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-12 02:23:11,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:11,254 INFO L93 Difference]: Finished difference Result 19595 states and 27071 transitions. [2023-11-12 02:23:11,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 02:23:11,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 183 [2023-11-12 02:23:11,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:11,299 INFO L225 Difference]: With dead ends: 19595 [2023-11-12 02:23:11,299 INFO L226 Difference]: Without dead ends: 11735 [2023-11-12 02:23:11,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:23:11,325 INFO L413 NwaCegarLoop]: 476 mSDtfsCounter, 552 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:11,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 1708 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-12 02:23:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11735 states. [2023-11-12 02:23:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11735 to 11200. [2023-11-12 02:23:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11200 states, 8341 states have (on average 1.3349718259201535) internal successors, (11135), 8466 states have internal predecessors, (11135), 2133 states have call successors, (2133), 702 states have call predecessors, (2133), 725 states have return successors, (2203), 2031 states have call predecessors, (2203), 2131 states have call successors, (2203) [2023-11-12 02:23:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11200 states to 11200 states and 15471 transitions. [2023-11-12 02:23:12,422 INFO L78 Accepts]: Start accepts. Automaton has 11200 states and 15471 transitions. Word has length 183 [2023-11-12 02:23:12,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:12,422 INFO L495 AbstractCegarLoop]: Abstraction has 11200 states and 15471 transitions. [2023-11-12 02:23:12,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-12 02:23:12,423 INFO L276 IsEmpty]: Start isEmpty. Operand 11200 states and 15471 transitions. [2023-11-12 02:23:12,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-11-12 02:23:12,452 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:12,452 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 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] [2023-11-12 02:23:12,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:23:12,453 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:12,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:12,453 INFO L85 PathProgramCache]: Analyzing trace with hash 960068590, now seen corresponding path program 2 times [2023-11-12 02:23:12,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:12,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24598937] [2023-11-12 02:23:12,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:12,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:23:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:23:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-12 02:23:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-12 02:23:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-12 02:23:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:23:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:23:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:23:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:23:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:23:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-12 02:23:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-12 02:23:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:23:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-12 02:23:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-12 02:23:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-12 02:23:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-12 02:23:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-12 02:23:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-12 02:23:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-11-12 02:23:12,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:12,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24598937] [2023-11-12 02:23:12,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24598937] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:12,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:12,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:23:12,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453641229] [2023-11-12 02:23:12,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:12,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:23:12,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:12,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:23:12,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:23:12,824 INFO L87 Difference]: Start difference. First operand 11200 states and 15471 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2023-11-12 02:23:15,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:15,850 INFO L93 Difference]: Finished difference Result 27023 states and 37507 transitions. [2023-11-12 02:23:15,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:23:15,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 183 [2023-11-12 02:23:15,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:15,919 INFO L225 Difference]: With dead ends: 27023 [2023-11-12 02:23:15,919 INFO L226 Difference]: Without dead ends: 15845 [2023-11-12 02:23:15,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:23:15,954 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 553 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:15,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1999 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-12 02:23:15,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15845 states. [2023-11-12 02:23:17,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15845 to 15094. [2023-11-12 02:23:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15094 states, 11423 states have (on average 1.3375645627243282) internal successors, (15279), 11562 states have internal predecessors, (15279), 2709 states have call successors, (2709), 918 states have call predecessors, (2709), 961 states have return successors, (2797), 2613 states have call predecessors, (2797), 2707 states have call successors, (2797) [2023-11-12 02:23:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15094 states to 15094 states and 20785 transitions. [2023-11-12 02:23:17,405 INFO L78 Accepts]: Start accepts. Automaton has 15094 states and 20785 transitions. Word has length 183 [2023-11-12 02:23:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:17,405 INFO L495 AbstractCegarLoop]: Abstraction has 15094 states and 20785 transitions. [2023-11-12 02:23:17,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2023-11-12 02:23:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 15094 states and 20785 transitions. [2023-11-12 02:23:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-12 02:23:17,442 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:17,443 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:17,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:23:17,443 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:17,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:17,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1801421611, now seen corresponding path program 1 times [2023-11-12 02:23:17,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:17,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423060853] [2023-11-12 02:23:17,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:17,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:23:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:23:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-12 02:23:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-12 02:23:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-12 02:23:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:23:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:23:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:23:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:23:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:23:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-12 02:23:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-12 02:23:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-12 02:23:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-12 02:23:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-12 02:23:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-12 02:23:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:17,875 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-11-12 02:23:17,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:17,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423060853] [2023-11-12 02:23:17,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423060853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:17,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:17,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:23:17,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772213401] [2023-11-12 02:23:17,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:17,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:23:17,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:17,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:23:17,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:23:17,879 INFO L87 Difference]: Start difference. First operand 15094 states and 20785 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-12 02:23:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:21,712 INFO L93 Difference]: Finished difference Result 41700 states and 58621 transitions. [2023-11-12 02:23:21,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 02:23:21,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 185 [2023-11-12 02:23:21,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:21,837 INFO L225 Difference]: With dead ends: 41700 [2023-11-12 02:23:21,837 INFO L226 Difference]: Without dead ends: 29941 [2023-11-12 02:23:21,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-12 02:23:21,871 INFO L413 NwaCegarLoop]: 689 mSDtfsCounter, 904 mSDsluCounter, 2169 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 2858 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:21,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 2858 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-12 02:23:21,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29941 states.