./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 9bd2c7ff 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_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu/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_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu --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-9bd2c7f [2023-11-19 07:09:27,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:09:27,489 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-19 07:09:27,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:09:27,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:09:27,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:09:27,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:09:27,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:09:27,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:09:27,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:09:27,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:09:27,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:09:27,530 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:09:27,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:09:27,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:09:27,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:09:27,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:09:27,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:09:27,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:09:27,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:09:27,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:09:27,540 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:09:27,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:09:27,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:09:27,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:09:27,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:09:27,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:09:27,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:09:27,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:09:27,544 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:09:27,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:09:27,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:09:27,546 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:09:27,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:09:27,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:09:27,547 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:09:27,547 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_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu/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_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu 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-19 07:09:27,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:09:27,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:09:27,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:09:27,868 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:09:27,869 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:09:27,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu/../../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-19 07:09:30,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:09:31,508 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:09:31,510 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9758af30-cc20-4be9-a171-9cf27a93fba3/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-19 07:09:31,553 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu/data/ed4f98d49/7c4c5b18c95c4315901cd5652642f409/FLAG2a8adc3f3 [2023-11-19 07:09:31,571 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu/data/ed4f98d49/7c4c5b18c95c4315901cd5652642f409 [2023-11-19 07:09:31,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:09:31,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:09:31,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:09:31,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:09:31,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:09:31,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:09:31" (1/1) ... [2023-11-19 07:09:31,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d53184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:31, skipping insertion in model container [2023-11-19 07:09:31,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:09:31" (1/1) ... [2023-11-19 07:09:31,727 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:09:32,368 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_9758af30-cc20-4be9-a171-9cf27a93fba3/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-19 07:09:32,554 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:09:32,602 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:09:32,763 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-19 07:09:32,765 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [3444] [2023-11-19 07:09:32,766 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3447] [2023-11-19 07:09:32,766 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3450] [2023-11-19 07:09:32,767 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3453] [2023-11-19 07:09:32,777 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_9758af30-cc20-4be9-a171-9cf27a93fba3/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-19 07:09:32,834 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:09:32,872 WARN L675 CHandler]: The function __bad_percpu_size is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:09:32,881 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:09:32,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:32 WrapperNode [2023-11-19 07:09:32,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:09:32,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:09:32,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:09:32,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:09:32,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:32" (1/1) ... [2023-11-19 07:09:32,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:32" (1/1) ... [2023-11-19 07:09:33,063 INFO L138 Inliner]: procedures = 113, calls = 447, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 1299 [2023-11-19 07:09:33,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:09:33,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:09:33,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:09:33,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:09:33,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:32" (1/1) ... [2023-11-19 07:09:33,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:32" (1/1) ... [2023-11-19 07:09:33,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:32" (1/1) ... [2023-11-19 07:09:33,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:32" (1/1) ... [2023-11-19 07:09:33,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:32" (1/1) ... [2023-11-19 07:09:33,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:32" (1/1) ... [2023-11-19 07:09:33,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:32" (1/1) ... [2023-11-19 07:09:33,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:32" (1/1) ... [2023-11-19 07:09:33,257 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:09:33,259 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:09:33,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:09:33,259 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:09:33,260 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:32" (1/1) ... [2023-11-19 07:09:33,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:09:33,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:09:33,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:09:33,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:09:33,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-19 07:09:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2023-11-19 07:09:33,375 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2023-11-19 07:09:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-19 07:09:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-19 07:09:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-19 07:09:33,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-19 07:09:33,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:09:33,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2023-11-19 07:09:33,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2023-11-19 07:09:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2023-11-19 07:09:33,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2023-11-19 07:09:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-19 07:09:33,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-19 07:09:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-19 07:09:33,378 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-19 07:09:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:09:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2023-11-19 07:09:33,378 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2023-11-19 07:09:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-19 07:09:33,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-19 07:09:33,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-19 07:09:33,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-19 07:09:33,379 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:09:33,379 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:09:33,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 07:09:33,380 INFO L130 BoogieDeclarations]: Found specification of procedure idmouse_resume [2023-11-19 07:09:33,380 INFO L138 BoogieDeclarations]: Found implementation of procedure idmouse_resume [2023-11-19 07:09:33,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2023-11-19 07:09:33,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2023-11-19 07:09:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_2 [2023-11-19 07:09:33,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_2 [2023-11-19 07:09:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:09:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-19 07:09:33,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-19 07:09:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 07:09:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:09:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2023-11-19 07:09:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_5 [2023-11-19 07:09:33,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_5 [2023-11-19 07:09:33,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 07:09:33,383 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2023-11-19 07:09:33,383 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2023-11-19 07:09:33,383 INFO L130 BoogieDeclarations]: Found specification of procedure idmouse_disconnect [2023-11-19 07:09:33,383 INFO L138 BoogieDeclarations]: Found implementation of procedure idmouse_disconnect [2023-11-19 07:09:33,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:09:33,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 07:09:33,384 INFO L130 BoogieDeclarations]: Found specification of procedure idmouse_delete [2023-11-19 07:09:33,384 INFO L138 BoogieDeclarations]: Found implementation of procedure idmouse_delete [2023-11-19 07:09:33,384 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2023-11-19 07:09:33,385 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2023-11-19 07:09:33,385 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2023-11-19 07:09:33,385 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2023-11-19 07:09:33,385 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2023-11-19 07:09:33,385 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2023-11-19 07:09:33,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:09:33,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2023-11-19 07:09:33,386 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2023-11-19 07:09:33,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2023-11-19 07:09:33,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:09:33,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:09:33,732 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:09:33,735 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:09:33,834 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-19 07:09:34,138 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2023-11-19 07:09:35,070 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:09:35,083 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:09:35,083 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:09:35,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:09:35 BoogieIcfgContainer [2023-11-19 07:09:35,090 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:09:35,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:09:35,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:09:35,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:09:35,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:09:31" (1/3) ... [2023-11-19 07:09:35,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee14848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:09:35, skipping insertion in model container [2023-11-19 07:09:35,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:32" (2/3) ... [2023-11-19 07:09:35,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee14848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:09:35, skipping insertion in model container [2023-11-19 07:09:35,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:09:35" (3/3) ... [2023-11-19 07:09:35,098 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-19 07:09:35,119 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:09:35,119 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:09:35,183 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:09:35,190 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;@4b9e5cd1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:09:35,190 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:09:35,198 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-19 07:09:35,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-19 07:09:35,211 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:35,212 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-19 07:09:35,212 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:35,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:35,219 INFO L85 PathProgramCache]: Analyzing trace with hash 153377320, now seen corresponding path program 1 times [2023-11-19 07:09:35,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:35,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469428588] [2023-11-19 07:09:35,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:35,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:09:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:09:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-19 07:09:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,953 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-19 07:09:35,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:35,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469428588] [2023-11-19 07:09:35,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469428588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:35,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:35,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:09:35,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250235957] [2023-11-19 07:09:35,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:35,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:09:35,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:36,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:09:36,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:09:36,004 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-19 07:09:37,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:37,535 INFO L93 Difference]: Finished difference Result 1122 states and 1625 transitions. [2023-11-19 07:09:37,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:09:37,538 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-19 07:09:37,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:37,558 INFO L225 Difference]: With dead ends: 1122 [2023-11-19 07:09:37,558 INFO L226 Difference]: Without dead ends: 723 [2023-11-19 07:09:37,565 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-19 07:09:37,569 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 527 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1133 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.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:37,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1133 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-19 07:09:37,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2023-11-19 07:09:37,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 696. [2023-11-19 07:09:37,687 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-19 07:09:37,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 974 transitions. [2023-11-19 07:09:37,696 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 974 transitions. Word has length 36 [2023-11-19 07:09:37,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:37,697 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 974 transitions. [2023-11-19 07:09:37,697 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-19 07:09:37,697 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 974 transitions. [2023-11-19 07:09:37,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-19 07:09:37,702 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:37,702 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-19 07:09:37,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:09:37,702 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:37,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:37,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1122525003, now seen corresponding path program 1 times [2023-11-19 07:09:37,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:37,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571387123] [2023-11-19 07:09:37,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:37,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:09:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:09:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-19 07:09:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:09:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,206 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-19 07:09:38,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:38,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571387123] [2023-11-19 07:09:38,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571387123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:38,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:38,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:09:38,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493693944] [2023-11-19 07:09:38,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:38,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:09:38,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:38,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:09:38,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:09:38,221 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-19 07:09:38,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:38,970 INFO L93 Difference]: Finished difference Result 722 states and 1015 transitions. [2023-11-19 07:09:38,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:09:38,971 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-19 07:09:38,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:38,987 INFO L225 Difference]: With dead ends: 722 [2023-11-19 07:09:38,988 INFO L226 Difference]: Without dead ends: 719 [2023-11-19 07:09:38,989 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-19 07:09:38,991 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-19 07:09:38,991 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-19 07:09:38,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2023-11-19 07:09:39,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 695. [2023-11-19 07:09:39,077 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-19 07:09:39,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 972 transitions. [2023-11-19 07:09:39,083 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 972 transitions. Word has length 46 [2023-11-19 07:09:39,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:39,084 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 972 transitions. [2023-11-19 07:09:39,084 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-19 07:09:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 972 transitions. [2023-11-19 07:09:39,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-19 07:09:39,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:39,087 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-19 07:09:39,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:09:39,088 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:39,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:39,088 INFO L85 PathProgramCache]: Analyzing trace with hash 438319802, now seen corresponding path program 1 times [2023-11-19 07:09:39,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:39,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792046536] [2023-11-19 07:09:39,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:39,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:09:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:09:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-19 07:09:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:09:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,428 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-19 07:09:39,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:39,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792046536] [2023-11-19 07:09:39,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792046536] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:39,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:39,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:09:39,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733772016] [2023-11-19 07:09:39,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:39,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:09:39,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:39,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:09:39,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:09:39,431 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-19 07:09:40,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:40,137 INFO L93 Difference]: Finished difference Result 721 states and 1013 transitions. [2023-11-19 07:09:40,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:09:40,138 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-19 07:09:40,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:40,146 INFO L225 Difference]: With dead ends: 721 [2023-11-19 07:09:40,146 INFO L226 Difference]: Without dead ends: 718 [2023-11-19 07:09:40,147 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-19 07:09:40,154 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-19 07:09:40,157 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-19 07:09:40,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2023-11-19 07:09:40,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 694. [2023-11-19 07:09:40,265 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-19 07:09:40,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 970 transitions. [2023-11-19 07:09:40,273 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 970 transitions. Word has length 47 [2023-11-19 07:09:40,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:40,273 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 970 transitions. [2023-11-19 07:09:40,274 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-19 07:09:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 970 transitions. [2023-11-19 07:09:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-19 07:09:40,281 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:40,281 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-19 07:09:40,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:09:40,285 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:40,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:40,286 INFO L85 PathProgramCache]: Analyzing trace with hash 702799918, now seen corresponding path program 1 times [2023-11-19 07:09:40,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:40,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253880027] [2023-11-19 07:09:40,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:40,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:09:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:09:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-19 07:09:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:09:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,524 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-19 07:09:40,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:40,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253880027] [2023-11-19 07:09:40,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253880027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:40,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:40,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:09:40,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643348622] [2023-11-19 07:09:40,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:40,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:09:40,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:40,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:09:40,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:09:40,527 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-19 07:09:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:41,187 INFO L93 Difference]: Finished difference Result 720 states and 1011 transitions. [2023-11-19 07:09:41,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:09:41,188 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-19 07:09:41,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:41,194 INFO L225 Difference]: With dead ends: 720 [2023-11-19 07:09:41,194 INFO L226 Difference]: Without dead ends: 717 [2023-11-19 07:09:41,195 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-19 07:09:41,196 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.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:41,197 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.5s Time] [2023-11-19 07:09:41,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2023-11-19 07:09:41,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 693. [2023-11-19 07:09:41,282 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-19 07:09:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 968 transitions. [2023-11-19 07:09:41,289 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 968 transitions. Word has length 48 [2023-11-19 07:09:41,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:41,291 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 968 transitions. [2023-11-19 07:09:41,292 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-19 07:09:41,292 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 968 transitions. [2023-11-19 07:09:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-19 07:09:41,293 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:41,294 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-19 07:09:41,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:09:41,294 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:41,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:41,294 INFO L85 PathProgramCache]: Analyzing trace with hash 311753789, now seen corresponding path program 1 times [2023-11-19 07:09:41,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:41,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236078904] [2023-11-19 07:09:41,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:41,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:09:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:09:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-19 07:09:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:09:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,464 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-19 07:09:41,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:41,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236078904] [2023-11-19 07:09:41,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236078904] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:41,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:41,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:09:41,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896145738] [2023-11-19 07:09:41,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:41,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:09:41,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:41,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:09:41,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:09:41,467 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-19 07:09:42,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:42,586 INFO L93 Difference]: Finished difference Result 2096 states and 2942 transitions. [2023-11-19 07:09:42,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:09:42,586 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-19 07:09:42,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:42,596 INFO L225 Difference]: With dead ends: 2096 [2023-11-19 07:09:42,596 INFO L226 Difference]: Without dead ends: 1414 [2023-11-19 07:09:42,599 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-19 07:09:42,602 INFO L413 NwaCegarLoop]: 568 mSDtfsCounter, 508 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:42,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1267 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-19 07:09:42,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2023-11-19 07:09:42,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1362. [2023-11-19 07:09:42,743 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-19 07:09:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1906 transitions. [2023-11-19 07:09:42,754 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1906 transitions. Word has length 49 [2023-11-19 07:09:42,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:42,755 INFO L495 AbstractCegarLoop]: Abstraction has 1362 states and 1906 transitions. [2023-11-19 07:09:42,755 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-19 07:09:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1906 transitions. [2023-11-19 07:09:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-19 07:09:42,758 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:42,759 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-19 07:09:42,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:09:42,759 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:42,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:42,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1074230545, now seen corresponding path program 1 times [2023-11-19 07:09:42,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:42,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231922438] [2023-11-19 07:09:42,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:42,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:09:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:09:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-19 07:09:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:09:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,938 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-19 07:09:42,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:42,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231922438] [2023-11-19 07:09:42,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231922438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:42,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:42,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:09:42,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252066472] [2023-11-19 07:09:42,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:42,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:09:42,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:42,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:09:42,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:09:42,941 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-19 07:09:43,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:43,620 INFO L93 Difference]: Finished difference Result 1412 states and 1984 transitions. [2023-11-19 07:09:43,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:09:43,620 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-19 07:09:43,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:43,630 INFO L225 Difference]: With dead ends: 1412 [2023-11-19 07:09:43,630 INFO L226 Difference]: Without dead ends: 1400 [2023-11-19 07:09:43,631 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-19 07:09:43,631 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.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:43,632 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.5s Time] [2023-11-19 07:09:43,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2023-11-19 07:09:43,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1352. [2023-11-19 07:09:43,743 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-19 07:09:43,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1892 transitions. [2023-11-19 07:09:43,754 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1892 transitions. Word has length 50 [2023-11-19 07:09:43,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:43,754 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 1892 transitions. [2023-11-19 07:09:43,754 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-19 07:09:43,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1892 transitions. [2023-11-19 07:09:43,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-19 07:09:43,759 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:43,759 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-19 07:09:43,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:09:43,759 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:43,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:43,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2071218089, now seen corresponding path program 1 times [2023-11-19 07:09:43,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:43,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433399116] [2023-11-19 07:09:43,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:43,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:43,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:09:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:43,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:09:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:43,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-19 07:09:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:43,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 07:09:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:43,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 07:09:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:43,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-19 07:09:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:43,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:43,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-19 07:09:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:43,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-19 07:09:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:43,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:09:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:43,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:09:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:43,986 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-19 07:09:43,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:43,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433399116] [2023-11-19 07:09:43,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433399116] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:43,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:43,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:09:43,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481159538] [2023-11-19 07:09:43,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:43,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:09:43,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:43,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:09:43,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:09:43,989 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-19 07:09:45,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:45,086 INFO L93 Difference]: Finished difference Result 3467 states and 4807 transitions. [2023-11-19 07:09:45,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:09:45,087 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-19 07:09:45,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:45,101 INFO L225 Difference]: With dead ends: 3467 [2023-11-19 07:09:45,101 INFO L226 Difference]: Without dead ends: 2126 [2023-11-19 07:09:45,108 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-19 07:09:45,109 INFO L413 NwaCegarLoop]: 439 mSDtfsCounter, 323 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1352 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.8s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:45,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1352 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 07:09:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2023-11-19 07:09:45,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2005. [2023-11-19 07:09:45,283 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-19 07:09:45,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2754 transitions. [2023-11-19 07:09:45,302 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2754 transitions. Word has length 107 [2023-11-19 07:09:45,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:45,302 INFO L495 AbstractCegarLoop]: Abstraction has 2005 states and 2754 transitions. [2023-11-19 07:09:45,302 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-19 07:09:45,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2754 transitions. [2023-11-19 07:09:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-19 07:09:45,312 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:45,312 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-19 07:09:45,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:09:45,313 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:45,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:45,313 INFO L85 PathProgramCache]: Analyzing trace with hash -810737814, now seen corresponding path program 1 times [2023-11-19 07:09:45,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:45,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735760126] [2023-11-19 07:09:45,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:45,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:09:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:09:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-19 07:09:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:09:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:09:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:09:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 07:09:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:09:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:09:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:09:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-19 07:09:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,748 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-19 07:09:45,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:45,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735760126] [2023-11-19 07:09:45,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735760126] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:09:45,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108595213] [2023-11-19 07:09:45,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:45,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:09:45,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:09:45,751 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:09:45,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:09:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:46,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 07:09:46,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:09:46,388 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-19 07:09:46,388 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:09:46,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108595213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:46,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:09:46,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-11-19 07:09:46,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541436663] [2023-11-19 07:09:46,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:46,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:09:46,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:46,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:09:46,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:09:46,391 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-19 07:09:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:47,072 INFO L93 Difference]: Finished difference Result 5984 states and 8220 transitions. [2023-11-19 07:09:47,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:09:47,073 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-19 07:09:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:47,110 INFO L225 Difference]: With dead ends: 5984 [2023-11-19 07:09:47,110 INFO L226 Difference]: Without dead ends: 5973 [2023-11-19 07:09:47,113 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-19 07:09:47,114 INFO L413 NwaCegarLoop]: 977 mSDtfsCounter, 898 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-19 07:09:47,114 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-19 07:09:47,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2023-11-19 07:09:47,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 5925. [2023-11-19 07:09:47,663 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-19 07:09:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5925 states to 5925 states and 8162 transitions. [2023-11-19 07:09:47,700 INFO L78 Accepts]: Start accepts. Automaton has 5925 states and 8162 transitions. Word has length 129 [2023-11-19 07:09:47,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:47,701 INFO L495 AbstractCegarLoop]: Abstraction has 5925 states and 8162 transitions. [2023-11-19 07:09:47,701 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-19 07:09:47,701 INFO L276 IsEmpty]: Start isEmpty. Operand 5925 states and 8162 transitions. [2023-11-19 07:09:47,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-19 07:09:47,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:47,718 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-19 07:09:47,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:09:47,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9758af30-cc20-4be9-a171-9cf27a93fba3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:09:47,932 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:47,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1895881580, now seen corresponding path program 1 times [2023-11-19 07:09:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:47,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811705347] [2023-11-19 07:09:47,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:47,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:09:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:09:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-19 07:09:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:09:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:09:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:09:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 07:09:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:09:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:09:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:09:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-19 07:09:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,707 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-19 07:09:48,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:48,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811705347] [2023-11-19 07:09:48,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811705347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:48,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:48,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:09:48,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101675685] [2023-11-19 07:09:48,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:48,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:09:48,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:48,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:09:48,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:09:48,711 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-19 07:09:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:50,698 INFO L93 Difference]: Finished difference Result 14911 states and 21201 transitions. [2023-11-19 07:09:50,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:09:50,698 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-19 07:09:50,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:50,767 INFO L225 Difference]: With dead ends: 14911 [2023-11-19 07:09:50,768 INFO L226 Difference]: Without dead ends: 9004 [2023-11-19 07:09:50,791 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-19 07:09:50,794 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-19 07:09:50,795 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-19 07:09:50,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9004 states. [2023-11-19 07:09:51,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9004 to 5985. [2023-11-19 07:09:51,534 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-19 07:09:51,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5985 states to 5985 states and 8246 transitions. [2023-11-19 07:09:51,572 INFO L78 Accepts]: Start accepts. Automaton has 5985 states and 8246 transitions. Word has length 129 [2023-11-19 07:09:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:51,572 INFO L495 AbstractCegarLoop]: Abstraction has 5985 states and 8246 transitions. [2023-11-19 07:09:51,573 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-19 07:09:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 5985 states and 8246 transitions. [2023-11-19 07:09:51,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-19 07:09:51,587 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:51,587 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-19 07:09:51,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:09:51,588 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:51,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:51,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1080095380, now seen corresponding path program 1 times [2023-11-19 07:09:51,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:51,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303303514] [2023-11-19 07:09:51,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:51,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:52,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:09:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:52,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:09:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:52,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-19 07:09:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:52,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:09:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:52,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:52,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:52,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:09:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:52,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:09:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:52,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:09:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:52,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-19 07:09:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:52,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:09:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:52,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:09:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:52,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:09:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:52,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-19 07:09:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:52,657 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-19 07:09:52,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:52,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303303514] [2023-11-19 07:09:52,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303303514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:52,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:52,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:09:52,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019712630] [2023-11-19 07:09:52,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:52,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:09:52,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:52,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:09:52,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:09:52,660 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-19 07:09:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:54,826 INFO L93 Difference]: Finished difference Result 14267 states and 19686 transitions. [2023-11-19 07:09:54,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:09:54,827 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-19 07:09:54,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:54,945 INFO L225 Difference]: With dead ends: 14267 [2023-11-19 07:09:54,945 INFO L226 Difference]: Without dead ends: 8300 [2023-11-19 07:09:54,961 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-19 07:09:54,961 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 387 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:54,963 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.2s Time] [2023-11-19 07:09:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8300 states. [2023-11-19 07:09:55,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8300 to 7878. [2023-11-19 07:09:55,705 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-19 07:09:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7878 states to 7878 states and 10838 transitions. [2023-11-19 07:09:55,734 INFO L78 Accepts]: Start accepts. Automaton has 7878 states and 10838 transitions. Word has length 135 [2023-11-19 07:09:55,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:55,735 INFO L495 AbstractCegarLoop]: Abstraction has 7878 states and 10838 transitions. [2023-11-19 07:09:55,735 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-19 07:09:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 7878 states and 10838 transitions. [2023-11-19 07:09:55,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-11-19 07:09:55,758 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:55,758 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-19 07:09:55,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:09:55,759 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:55,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:55,760 INFO L85 PathProgramCache]: Analyzing trace with hash 475996142, now seen corresponding path program 1 times [2023-11-19 07:09:55,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:55,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610060797] [2023-11-19 07:09:55,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:55,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:55,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:09:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:55,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:09:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:55,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-19 07:09:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:55,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:09:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:55,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:09:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:55,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:09:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:55,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:09:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:55,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:55,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:09:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:55,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:09:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:55,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:09:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:55,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-19 07:09:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:55,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:09:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:55,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:09:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:56,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-19 07:09:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:56,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:09:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:56,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-19 07:09:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:56,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-19 07:09:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:56,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-19 07:09:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:56,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-19 07:09:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:56,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-19 07:09:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:56,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-19 07:09:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:56,056 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-19 07:09:56,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:56,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610060797] [2023-11-19 07:09:56,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610060797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:56,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:56,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:09:56,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610945600] [2023-11-19 07:09:56,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:56,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:09:56,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:56,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:09:56,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:09:56,060 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-19 07:09:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:58,517 INFO L93 Difference]: Finished difference Result 19595 states and 27071 transitions. [2023-11-19 07:09:58,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 07:09:58,517 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-19 07:09:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:58,566 INFO L225 Difference]: With dead ends: 19595 [2023-11-19 07:09:58,566 INFO L226 Difference]: Without dead ends: 11735 [2023-11-19 07:09:58,592 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-19 07:09:58,593 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.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:58,594 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.2s Time] [2023-11-19 07:09:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11735 states. [2023-11-19 07:09:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11735 to 11200. [2023-11-19 07:09:59,642 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-19 07:09:59,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11200 states to 11200 states and 15471 transitions. [2023-11-19 07:09:59,689 INFO L78 Accepts]: Start accepts. Automaton has 11200 states and 15471 transitions. Word has length 183 [2023-11-19 07:09:59,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:59,689 INFO L495 AbstractCegarLoop]: Abstraction has 11200 states and 15471 transitions. [2023-11-19 07:09:59,689 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-19 07:09:59,690 INFO L276 IsEmpty]: Start isEmpty. Operand 11200 states and 15471 transitions. [2023-11-19 07:09:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-11-19 07:09:59,719 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:59,720 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-19 07:09:59,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:09:59,720 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:59,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:59,721 INFO L85 PathProgramCache]: Analyzing trace with hash 960068590, now seen corresponding path program 2 times [2023-11-19 07:09:59,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:59,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730252109] [2023-11-19 07:09:59,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:59,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:59,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:09:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:59,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:09:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:59,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-19 07:09:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:59,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:09:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:59,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:59,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:00,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-19 07:10:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:00,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:10:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:00,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:10:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:00,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:10:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:00,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:10:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:00,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:10:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:00,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:10:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:00,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:10:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:00,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-19 07:10:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:00,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:10:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:00,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-19 07:10:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:00,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-19 07:10:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:00,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-19 07:10:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:00,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-19 07:10:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:00,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-19 07:10:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:00,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-19 07:10:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:00,142 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-19 07:10:00,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:10:00,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730252109] [2023-11-19 07:10:00,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730252109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:10:00,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:10:00,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:10:00,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734971332] [2023-11-19 07:10:00,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:10:00,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:10:00,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:10:00,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:10:00,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:10:00,145 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-19 07:10:02,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:10:02,735 INFO L93 Difference]: Finished difference Result 27023 states and 37507 transitions. [2023-11-19 07:10:02,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:10:02,736 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-19 07:10:02,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:10:02,795 INFO L225 Difference]: With dead ends: 27023 [2023-11-19 07:10:02,796 INFO L226 Difference]: Without dead ends: 15845 [2023-11-19 07:10:02,823 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-19 07:10:02,824 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 553 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:10:02,824 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.4s Time] [2023-11-19 07:10:02,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15845 states. [2023-11-19 07:10:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15845 to 15094. [2023-11-19 07:10:04,403 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-19 07:10:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15094 states to 15094 states and 20785 transitions. [2023-11-19 07:10:04,462 INFO L78 Accepts]: Start accepts. Automaton has 15094 states and 20785 transitions. Word has length 183 [2023-11-19 07:10:04,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:10:04,463 INFO L495 AbstractCegarLoop]: Abstraction has 15094 states and 20785 transitions. [2023-11-19 07:10:04,463 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-19 07:10:04,463 INFO L276 IsEmpty]: Start isEmpty. Operand 15094 states and 20785 transitions. [2023-11-19 07:10:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-19 07:10:04,499 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:10:04,500 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-19 07:10:04,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:10:04,500 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:10:04,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:10:04,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1801421611, now seen corresponding path program 1 times [2023-11-19 07:10:04,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:10:04,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224867405] [2023-11-19 07:10:04,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:10:04,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:10:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:10:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:10:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-19 07:10:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:10:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:10:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:10:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-19 07:10:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:10:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:10:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-19 07:10:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:10:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:10:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:10:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-19 07:10:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-19 07:10:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-19 07:10:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-19 07:10:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-19 07:10:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-19 07:10:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:04,935 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-19 07:10:04,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:10:04,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224867405] [2023-11-19 07:10:04,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224867405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:10:04,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:10:04,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:10:04,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69239411] [2023-11-19 07:10:04,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:10:04,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:10:04,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:10:04,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:10:04,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:10:04,938 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-19 07:10:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:10:08,396 INFO L93 Difference]: Finished difference Result 41700 states and 58621 transitions. [2023-11-19 07:10:08,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-19 07:10:08,397 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-19 07:10:08,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:10:08,512 INFO L225 Difference]: With dead ends: 41700 [2023-11-19 07:10:08,512 INFO L226 Difference]: Without dead ends: 29941 [2023-11-19 07:10:08,540 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-19 07:10:08,541 INFO L413 NwaCegarLoop]: 689 mSDtfsCounter, 904 mSDsluCounter, 2169 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:10:08,541 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.5s Time] [2023-11-19 07:10:08,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29941 states. [2023-11-19 07:10:10,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29941 to 15086. [2023-11-19 07:10:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15086 states, 11431 states have (on average 1.337328317732482) internal successors, (15287), 11570 states have internal predecessors, (15287), 2701 states have call successors, (2701), 910 states have call predecessors, (2701), 953 states have return successors, (2789), 2605 states have call predecessors, (2789), 2699 states have call successors, (2789) [2023-11-19 07:10:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15086 states to 15086 states and 20777 transitions. [2023-11-19 07:10:10,101 INFO L78 Accepts]: Start accepts. Automaton has 15086 states and 20777 transitions. Word has length 185 [2023-11-19 07:10:10,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:10:10,102 INFO L495 AbstractCegarLoop]: Abstraction has 15086 states and 20777 transitions. [2023-11-19 07:10:10,102 INFO L496 AbstractCegarLoop]: INTERPOLANT 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) [2023-11-19 07:10:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 15086 states and 20777 transitions. [2023-11-19 07:10:10,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2023-11-19 07:10:10,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:10:10,145 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:10:10,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:10:10,146 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:10:10,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:10:10,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1963300691, now seen corresponding path program 1 times [2023-11-19 07:10:10,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:10:10,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945702572] [2023-11-19 07:10:10,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:10:10,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:10:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:10:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:10:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-19 07:10:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:10:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:10:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:10:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-19 07:10:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-19 07:10:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:10:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:10:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:10:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:10:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:10:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:10:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:10:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-19 07:10:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:10:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-19 07:10:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-19 07:10:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-19 07:10:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-19 07:10:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-19 07:10:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-19 07:10:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:10:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-11-19 07:10:10,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:10:10,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945702572] [2023-11-19 07:10:10,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945702572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:10:10,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:10:10,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:10:10,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612897393] [2023-11-19 07:10:10,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:10:10,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:10:10,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:10:10,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:10:10,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:10:10,492 INFO L87 Difference]: Start difference. First operand 15086 states and 20777 transitions. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)