./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 9b31a0de2b621799e7704a1edbde99c549dd0681127022ee400e76db9f90281d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:47:25,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:47:25,124 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 12:47:25,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:47:25,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:47:25,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:47:25,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:47:25,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:47:25,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:47:25,150 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:47:25,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:47:25,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:47:25,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:47:25,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:47:25,152 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:47:25,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:47:25,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:47:25,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:47:25,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:47:25,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:47:25,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:47:25,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:47:25,158 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:47:25,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:47:25,158 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:47:25,158 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:47:25,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:47:25,159 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:47:25,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:47:25,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:47:25,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:47:25,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:47:25,160 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:47:25,160 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:47:25,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:47:25,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:47:25,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:47:25,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:47:25,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:47:25,164 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 9b31a0de2b621799e7704a1edbde99c549dd0681127022ee400e76db9f90281d [2024-10-24 12:47:25,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:47:25,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:47:25,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:47:25,431 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:47:25,431 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:47:25,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2024-10-24 12:47:26,918 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:47:27,385 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:47:27,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2024-10-24 12:47:27,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5dda51f/b1eb00ac40f84481afb9f93e820e0fbf/FLAGbe88e1192 [2024-10-24 12:47:27,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5dda51f/b1eb00ac40f84481afb9f93e820e0fbf [2024-10-24 12:47:27,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:47:27,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:47:27,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:47:27,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:47:27,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:47:27,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:47:27" (1/1) ... [2024-10-24 12:47:27,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@756f3ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:47:27, skipping insertion in model container [2024-10-24 12:47:27,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:47:27" (1/1) ... [2024-10-24 12:47:27,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:47:27,870 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4497,4510] [2024-10-24 12:47:27,878 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4557,4570] [2024-10-24 12:47:28,462 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:28,463 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:28,464 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:28,464 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:28,468 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:28,485 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:28,485 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:28,487 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:28,487 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:28,971 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:28,971 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:29,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:47:29,123 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:47:29,139 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4497,4510] [2024-10-24 12:47:29,140 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4557,4570] [2024-10-24 12:47:29,172 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:29,173 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:29,173 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:29,173 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:29,174 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:29,179 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:29,180 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:29,181 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:29,181 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:29,298 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] [2024-10-24 12:47:29,300 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:29,301 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:47:29,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] [2024-10-24 12:47:29,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:47:29,580 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:47:29,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:47:29 WrapperNode [2024-10-24 12:47:29,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:47:29,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:47:29,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:47:29,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:47:29,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:47:29" (1/1) ... [2024-10-24 12:47:29,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:47:29" (1/1) ... [2024-10-24 12:47:29,776 INFO L138 Inliner]: procedures = 679, calls = 2598, calls flagged for inlining = 56, calls inlined = 4, statements flattened = 762 [2024-10-24 12:47:29,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:47:29,782 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:47:29,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:47:29,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:47:29,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:47:29" (1/1) ... [2024-10-24 12:47:29,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:47:29" (1/1) ... [2024-10-24 12:47:29,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:47:29" (1/1) ... [2024-10-24 12:47:29,882 INFO L175 MemorySlicer]: Split 527 memory accesses to 5 slices as follows [2, 256, 238, 26, 5]. 49 percent of accesses are in the largest equivalence class. The 503 initializations are split as follows [2, 256, 236, 4, 5]. The 4 writes are split as follows [0, 0, 0, 4, 0]. [2024-10-24 12:47:29,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:47:29" (1/1) ... [2024-10-24 12:47:29,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:47:29" (1/1) ... [2024-10-24 12:47:29,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:47:29" (1/1) ... [2024-10-24 12:47:29,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:47:29" (1/1) ... [2024-10-24 12:47:29,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:47:29" (1/1) ... [2024-10-24 12:47:29,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:47:29" (1/1) ... [2024-10-24 12:47:30,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:47:30,015 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:47:30,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:47:30,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:47:30,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:47:29" (1/1) ... [2024-10-24 12:47:30,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:47:30,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:47:30,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 12:47:30,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 12:47:30,113 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2024-10-24 12:47:30,115 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2024-10-24 12:47:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 12:47:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 12:47:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 12:47:30,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 12:47:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 12:47:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 12:47:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 12:47:30,117 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 12:47:30,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 12:47:30,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:47:30,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 12:47:30,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 12:47:30,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 12:47:30,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 12:47:30,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-24 12:47:30,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:47:30,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:47:30,119 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-10-24 12:47:30,119 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-10-24 12:47:30,119 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2024-10-24 12:47:30,120 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2024-10-24 12:47:30,120 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 12:47:30,120 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 12:47:30,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 12:47:30,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 12:47:30,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 12:47:30,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 12:47:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 12:47:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-24 12:47:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 12:47:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 12:47:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 12:47:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-24 12:47:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-24 12:47:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-10-24 12:47:30,122 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-10-24 12:47:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 12:47:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 12:47:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 12:47:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 12:47:30,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 12:47:30,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:47:30,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 12:47:30,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 12:47:30,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 12:47:30,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 12:47:30,124 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_from_array [2024-10-24 12:47:30,125 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_from_array [2024-10-24 12:47:30,435 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:47:30,437 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:47:31,228 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-10-24 12:47:31,228 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:47:31,337 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:47:31,337 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 12:47:31,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:47:31 BoogieIcfgContainer [2024-10-24 12:47:31,338 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:47:31,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:47:31,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:47:31,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:47:31,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:47:27" (1/3) ... [2024-10-24 12:47:31,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134a76d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:47:31, skipping insertion in model container [2024-10-24 12:47:31,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:47:29" (2/3) ... [2024-10-24 12:47:31,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134a76d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:47:31, skipping insertion in model container [2024-10-24 12:47:31,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:47:31" (3/3) ... [2024-10-24 12:47:31,348 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_array_harness.i [2024-10-24 12:47:31,364 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:47:31,365 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:47:31,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:47:31,440 INFO L333 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, 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;@72a8c311, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:47:31,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 12:47:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 12:47:31,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 12:47:31,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:47:31,455 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 12:47:31,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:47:31,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:47:31,462 INFO L85 PathProgramCache]: Analyzing trace with hash -38033640, now seen corresponding path program 1 times [2024-10-24 12:47:31,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:47:31,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093235328] [2024-10-24 12:47:31,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:47:31,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:47:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:32,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:32,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:47:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:32,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:32,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 12:47:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:32,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:47:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:47:32,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:47:32,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093235328] [2024-10-24 12:47:32,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093235328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:47:32,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:47:32,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:47:32,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933550995] [2024-10-24 12:47:32,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:47:32,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:47:32,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:47:32,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:47:32,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:47:32,585 INFO L87 Difference]: Start difference. First operand has 69 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 12:47:32,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:47:32,905 INFO L93 Difference]: Finished difference Result 132 states and 181 transitions. [2024-10-24 12:47:32,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:47:32,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-10-24 12:47:32,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:47:32,920 INFO L225 Difference]: With dead ends: 132 [2024-10-24 12:47:32,920 INFO L226 Difference]: Without dead ends: 67 [2024-10-24 12:47:32,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:47:32,929 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 35 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:47:32,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 163 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:47:32,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-24 12:47:32,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-24 12:47:32,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2024-10-24 12:47:32,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2024-10-24 12:47:32,980 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 32 [2024-10-24 12:47:32,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:47:32,981 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2024-10-24 12:47:32,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 12:47:32,982 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2024-10-24 12:47:32,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 12:47:32,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:47:32,986 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 12:47:32,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:47:32,986 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:47:32,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:47:32,987 INFO L85 PathProgramCache]: Analyzing trace with hash -855055317, now seen corresponding path program 1 times [2024-10-24 12:47:32,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:47:32,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489931846] [2024-10-24 12:47:32,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:47:32,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:47:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:33,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:33,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:47:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:33,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:33,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 12:47:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:33,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:47:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:47:33,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:47:33,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489931846] [2024-10-24 12:47:33,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489931846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:47:33,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:47:33,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:47:33,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868775848] [2024-10-24 12:47:33,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:47:33,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:47:33,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:47:33,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:47:33,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:47:33,550 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 12:47:33,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:47:33,809 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2024-10-24 12:47:33,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:47:33,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2024-10-24 12:47:33,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:47:33,811 INFO L225 Difference]: With dead ends: 121 [2024-10-24 12:47:33,811 INFO L226 Difference]: Without dead ends: 70 [2024-10-24 12:47:33,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:47:33,813 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 38 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:47:33,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 116 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:47:33,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-24 12:47:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-10-24 12:47:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 46 states have internal predecessors, (52), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2024-10-24 12:47:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2024-10-24 12:47:33,829 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 38 [2024-10-24 12:47:33,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:47:33,829 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2024-10-24 12:47:33,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 12:47:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2024-10-24 12:47:33,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 12:47:33,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:47:33,832 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 12:47:33,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:47:33,832 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:47:33,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:47:33,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1248082327, now seen corresponding path program 1 times [2024-10-24 12:47:33,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:47:33,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116161673] [2024-10-24 12:47:33,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:47:33,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:47:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:34,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:34,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:47:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:34,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:34,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 12:47:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:34,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:47:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:47:34,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:47:34,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116161673] [2024-10-24 12:47:34,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116161673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:47:34,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:47:34,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:47:34,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890471967] [2024-10-24 12:47:34,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:47:34,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:47:34,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:47:34,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:47:34,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:47:34,237 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 12:47:34,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:47:34,464 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2024-10-24 12:47:34,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:47:34,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2024-10-24 12:47:34,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:47:34,467 INFO L225 Difference]: With dead ends: 124 [2024-10-24 12:47:34,467 INFO L226 Difference]: Without dead ends: 71 [2024-10-24 12:47:34,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:47:34,470 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 36 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:47:34,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 116 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:47:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-24 12:47:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-24 12:47:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.173913043478261) internal successors, (54), 48 states have internal predecessors, (54), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2024-10-24 12:47:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2024-10-24 12:47:34,489 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 38 [2024-10-24 12:47:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:47:34,490 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2024-10-24 12:47:34,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 12:47:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2024-10-24 12:47:34,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 12:47:34,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:47:34,493 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 12:47:34,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:47:34,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:47:34,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:47:34,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1113220755, now seen corresponding path program 1 times [2024-10-24 12:47:34,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:47:34,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734194670] [2024-10-24 12:47:34,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:47:34,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:47:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:35,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:35,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:47:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:35,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:35,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 12:47:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:35,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:47:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:47:35,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:47:35,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734194670] [2024-10-24 12:47:35,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734194670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:47:35,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:47:35,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:47:35,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207889421] [2024-10-24 12:47:35,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:47:35,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:47:35,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:47:35,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:47:35,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:47:35,521 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 12:47:35,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:47:35,938 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2024-10-24 12:47:35,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:47:35,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2024-10-24 12:47:35,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:47:35,940 INFO L225 Difference]: With dead ends: 82 [2024-10-24 12:47:35,940 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 12:47:35,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-24 12:47:35,942 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 41 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:47:35,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 233 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:47:35,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 12:47:35,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-10-24 12:47:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 54 states have internal predecessors, (59), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2024-10-24 12:47:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2024-10-24 12:47:35,955 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 38 [2024-10-24 12:47:35,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:47:35,956 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2024-10-24 12:47:35,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 12:47:35,956 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2024-10-24 12:47:35,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 12:47:35,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:47:35,957 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 12:47:35,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:47:35,958 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:47:35,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:47:35,958 INFO L85 PathProgramCache]: Analyzing trace with hash 319442081, now seen corresponding path program 1 times [2024-10-24 12:47:35,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:47:35,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767281029] [2024-10-24 12:47:35,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:47:35,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:47:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:38,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:38,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:47:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:38,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:38,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 12:47:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:38,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:47:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:47:38,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:47:38,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767281029] [2024-10-24 12:47:38,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767281029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:47:38,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:47:38,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:47:38,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641633840] [2024-10-24 12:47:38,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:47:38,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:47:38,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:47:38,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:47:38,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:47:38,423 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 12:47:38,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:47:38,862 INFO L93 Difference]: Finished difference Result 148 states and 179 transitions. [2024-10-24 12:47:38,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:47:38,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2024-10-24 12:47:38,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:47:38,866 INFO L225 Difference]: With dead ends: 148 [2024-10-24 12:47:38,867 INFO L226 Difference]: Without dead ends: 90 [2024-10-24 12:47:38,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:47:38,870 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 60 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:47:38,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 154 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:47:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-24 12:47:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2024-10-24 12:47:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 58 states have internal predecessors, (64), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2024-10-24 12:47:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2024-10-24 12:47:38,885 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 42 [2024-10-24 12:47:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:47:38,885 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2024-10-24 12:47:38,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 12:47:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2024-10-24 12:47:38,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 12:47:38,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:47:38,887 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 12:47:38,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:47:38,887 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:47:38,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:47:38,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1020506659, now seen corresponding path program 1 times [2024-10-24 12:47:38,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:47:38,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326682177] [2024-10-24 12:47:38,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:47:38,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:47:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:39,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:39,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:47:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:39,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:39,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 12:47:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:39,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:47:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:47:39,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:47:39,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326682177] [2024-10-24 12:47:39,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326682177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:47:39,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:47:39,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:47:39,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940490514] [2024-10-24 12:47:39,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:47:39,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:47:39,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:47:39,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:47:39,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:47:39,563 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 12:47:39,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:47:39,890 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions. [2024-10-24 12:47:39,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:47:39,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2024-10-24 12:47:39,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:47:39,892 INFO L225 Difference]: With dead ends: 160 [2024-10-24 12:47:39,894 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 12:47:39,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:47:39,895 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 56 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:47:39,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 141 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:47:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 12:47:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2024-10-24 12:47:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 61 states have internal predecessors, (67), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2024-10-24 12:47:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2024-10-24 12:47:39,909 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 42 [2024-10-24 12:47:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:47:39,910 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2024-10-24 12:47:39,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 12:47:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2024-10-24 12:47:39,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 12:47:39,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:47:39,913 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 12:47:39,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:47:39,913 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:47:39,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:47:39,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1242275033, now seen corresponding path program 1 times [2024-10-24 12:47:39,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:47:39,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673544749] [2024-10-24 12:47:39,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:47:39,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:47:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:42,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:42,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:47:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:42,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:42,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 12:47:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:42,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:47:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:47:43,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:47:43,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673544749] [2024-10-24 12:47:43,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673544749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:47:43,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:47:43,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:47:43,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560484279] [2024-10-24 12:47:43,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:47:43,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:47:43,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:47:43,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:47:43,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:47:43,025 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 12:47:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:47:43,581 INFO L93 Difference]: Finished difference Result 176 states and 213 transitions. [2024-10-24 12:47:43,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 12:47:43,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2024-10-24 12:47:43,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:47:43,583 INFO L225 Difference]: With dead ends: 176 [2024-10-24 12:47:43,583 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 12:47:43,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2024-10-24 12:47:43,584 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 105 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:47:43,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 174 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 12:47:43,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 12:47:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 91. [2024-10-24 12:47:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 66 states have internal predecessors, (75), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2024-10-24 12:47:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2024-10-24 12:47:43,594 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 42 [2024-10-24 12:47:43,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:47:43,594 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2024-10-24 12:47:43,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 12:47:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2024-10-24 12:47:43,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 12:47:43,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:47:43,596 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 12:47:43,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 12:47:43,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:47:43,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:47:43,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2041575013, now seen corresponding path program 1 times [2024-10-24 12:47:43,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:47:43,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616064554] [2024-10-24 12:47:43,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:47:43,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:47:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:45,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:45,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:47:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:45,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:45,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 12:47:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:45,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:47:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:47:45,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:47:45,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616064554] [2024-10-24 12:47:45,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616064554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:47:45,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:47:45,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:47:45,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324236545] [2024-10-24 12:47:45,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:47:45,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:47:45,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:47:45,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:47:45,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:47:45,966 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 12:47:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:47:46,668 INFO L93 Difference]: Finished difference Result 191 states and 232 transitions. [2024-10-24 12:47:46,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:47:46,669 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2024-10-24 12:47:46,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:47:46,671 INFO L225 Difference]: With dead ends: 191 [2024-10-24 12:47:46,671 INFO L226 Difference]: Without dead ends: 121 [2024-10-24 12:47:46,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-10-24 12:47:46,673 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 103 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:47:46,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 154 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 12:47:46,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-24 12:47:46,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 88. [2024-10-24 12:47:46,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 63 states have internal predecessors, (70), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2024-10-24 12:47:46,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2024-10-24 12:47:46,684 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 42 [2024-10-24 12:47:46,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:47:46,684 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2024-10-24 12:47:46,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 12:47:46,684 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2024-10-24 12:47:46,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 12:47:46,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:47:46,685 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 12:47:46,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 12:47:46,686 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:47:46,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:47:46,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1503193660, now seen corresponding path program 1 times [2024-10-24 12:47:46,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:47:46,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298737954] [2024-10-24 12:47:46,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:47:46,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:47:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:47,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:47,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:47:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:47,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:47,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 12:47:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:47,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:47:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:47,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:47:47,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:47:47,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298737954] [2024-10-24 12:47:47,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298737954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:47:47,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:47:47,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 12:47:47,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377033994] [2024-10-24 12:47:47,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:47:47,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:47:47,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:47:47,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:47:47,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:47:47,525 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 12:47:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:47:47,950 INFO L93 Difference]: Finished difference Result 106 states and 125 transitions. [2024-10-24 12:47:47,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 12:47:47,950 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 44 [2024-10-24 12:47:47,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:47:47,952 INFO L225 Difference]: With dead ends: 106 [2024-10-24 12:47:47,952 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 12:47:47,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-10-24 12:47:47,952 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:47:47,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 295 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:47:47,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 12:47:47,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 90. [2024-10-24 12:47:47,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 65 states have internal predecessors, (72), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2024-10-24 12:47:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2024-10-24 12:47:47,969 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 44 [2024-10-24 12:47:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:47:47,970 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2024-10-24 12:47:47,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 12:47:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2024-10-24 12:47:47,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 12:47:47,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:47:47,972 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 12:47:47,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 12:47:47,973 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:47:47,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:47:47,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1110166650, now seen corresponding path program 1 times [2024-10-24 12:47:47,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:47:47,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909436140] [2024-10-24 12:47:47,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:47:47,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:47:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:50,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:50,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:47:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:50,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:50,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 12:47:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:50,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:47:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:47:51,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:47:51,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909436140] [2024-10-24 12:47:51,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909436140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:47:51,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:47:51,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-24 12:47:51,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994347675] [2024-10-24 12:47:51,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:47:51,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 12:47:51,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:47:51,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 12:47:51,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2024-10-24 12:47:51,307 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 20 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 12:47:52,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:47:52,772 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2024-10-24 12:47:52,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-24 12:47:52,773 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 44 [2024-10-24 12:47:52,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:47:52,774 INFO L225 Difference]: With dead ends: 114 [2024-10-24 12:47:52,774 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 12:47:52,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=163, Invalid=1319, Unknown=0, NotChecked=0, Total=1482 [2024-10-24 12:47:52,776 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 93 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 12:47:52,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 397 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 12:47:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 12:47:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 84. [2024-10-24 12:47:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 60 states have internal predecessors, (68), 16 states have call successors, (16), 8 states have call predecessors, (16), 9 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2024-10-24 12:47:52,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2024-10-24 12:47:52,796 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 44 [2024-10-24 12:47:52,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:47:52,796 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2024-10-24 12:47:52,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 12:47:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2024-10-24 12:47:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 12:47:52,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:47:52,797 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 12:47:52,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 12:47:52,797 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:47:52,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:47:52,798 INFO L85 PathProgramCache]: Analyzing trace with hash -817001920, now seen corresponding path program 1 times [2024-10-24 12:47:52,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:47:52,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785476341] [2024-10-24 12:47:52,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:47:52,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:47:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:53,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:53,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:47:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:53,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:53,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 12:47:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:53,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:53,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 12:47:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:53,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 12:47:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:53,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 12:47:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:53,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 12:47:53,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:47:53,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785476341] [2024-10-24 12:47:53,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785476341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:47:53,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:47:53,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 12:47:53,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007754393] [2024-10-24 12:47:53,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:47:53,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 12:47:53,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:47:53,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 12:47:53,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:47:53,174 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 12:47:53,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:47:53,429 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2024-10-24 12:47:53,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:47:53,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2024-10-24 12:47:53,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:47:53,431 INFO L225 Difference]: With dead ends: 114 [2024-10-24 12:47:53,431 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 12:47:53,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:47:53,432 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 43 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:47:53,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 85 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:47:53,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 12:47:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 12:47:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 60 states have internal predecessors, (67), 16 states have call successors, (16), 8 states have call predecessors, (16), 9 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2024-10-24 12:47:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2024-10-24 12:47:53,440 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 51 [2024-10-24 12:47:53,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:47:53,440 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2024-10-24 12:47:53,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 12:47:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2024-10-24 12:47:53,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 12:47:53,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:47:53,441 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:47:53,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 12:47:53,441 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:47:53,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:47:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1841204885, now seen corresponding path program 1 times [2024-10-24 12:47:53,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:47:53,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196595749] [2024-10-24 12:47:53,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:47:53,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:47:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:54,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:54,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:47:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:54,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:54,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 12:47:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:54,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:54,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 12:47:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:54,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 12:47:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:54,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 12:47:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:54,185 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 12:47:54,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:47:54,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196595749] [2024-10-24 12:47:54,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196595749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:47:54,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:47:54,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:47:54,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256409548] [2024-10-24 12:47:54,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:47:54,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:47:54,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:47:54,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:47:54,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:47:54,187 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 12:47:54,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:47:54,587 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2024-10-24 12:47:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:47:54,587 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2024-10-24 12:47:54,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:47:54,588 INFO L225 Difference]: With dead ends: 95 [2024-10-24 12:47:54,588 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 12:47:54,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:47:54,589 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 73 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:47:54,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 217 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:47:54,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 12:47:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-24 12:47:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 66 states have internal predecessors, (72), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2024-10-24 12:47:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 108 transitions. [2024-10-24 12:47:54,604 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 108 transitions. Word has length 57 [2024-10-24 12:47:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:47:54,604 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 108 transitions. [2024-10-24 12:47:54,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 12:47:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2024-10-24 12:47:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-24 12:47:54,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:47:54,605 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:47:54,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 12:47:54,606 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:47:54,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:47:54,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1662136887, now seen corresponding path program 1 times [2024-10-24 12:47:54,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:47:54,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563880535] [2024-10-24 12:47:54,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:47:54,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:47:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:56,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:56,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:47:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:56,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:56,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 12:47:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:56,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:47:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:56,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 12:47:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:56,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 12:47:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:56,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 12:47:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 12:47:56,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:47:56,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563880535] [2024-10-24 12:47:56,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563880535] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:47:56,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790553130] [2024-10-24 12:47:56,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:47:56,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:47:56,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:47:56,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:47:56,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 12:47:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:47:57,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 2486 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-24 12:47:57,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:47:57,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 1 [2024-10-24 12:47:58,366 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:47:58,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:47:58,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 702 treesize of output 686 [2024-10-24 12:47:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 12:47:59,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790553130] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 12:47:59,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 12:47:59,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 14] total 34 [2024-10-24 12:47:59,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57166655] [2024-10-24 12:47:59,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 12:47:59,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-24 12:47:59,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:47:59,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-24 12:47:59,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2024-10-24 12:47:59,276 INFO L87 Difference]: Start difference. First operand 92 states and 108 transitions. Second operand has 34 states, 27 states have (on average 2.925925925925926) internal successors, (79), 27 states have internal predecessors, (79), 8 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-24 12:48:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:48:07,038 INFO L93 Difference]: Finished difference Result 238 states and 280 transitions. [2024-10-24 12:48:07,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-24 12:48:07,038 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 27 states have (on average 2.925925925925926) internal successors, (79), 27 states have internal predecessors, (79), 8 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 61 [2024-10-24 12:48:07,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:48:07,040 INFO L225 Difference]: With dead ends: 238 [2024-10-24 12:48:07,040 INFO L226 Difference]: Without dead ends: 199 [2024-10-24 12:48:07,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 113 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=424, Invalid=2546, Unknown=0, NotChecked=0, Total=2970 [2024-10-24 12:48:07,042 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 305 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 91 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 12:48:07,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 245 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1944 Invalid, 19 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 12:48:07,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-24 12:48:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 164. [2024-10-24 12:48:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 117 states have (on average 1.1538461538461537) internal successors, (135), 122 states have internal predecessors, (135), 27 states have call successors, (27), 14 states have call predecessors, (27), 19 states have return successors, (31), 27 states have call predecessors, (31), 25 states have call successors, (31) [2024-10-24 12:48:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 193 transitions. [2024-10-24 12:48:07,066 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 193 transitions. Word has length 61 [2024-10-24 12:48:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:48:07,066 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 193 transitions. [2024-10-24 12:48:07,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 27 states have (on average 2.925925925925926) internal successors, (79), 27 states have internal predecessors, (79), 8 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-24 12:48:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 193 transitions. [2024-10-24 12:48:07,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-24 12:48:07,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:48:07,069 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:48:07,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 12:48:07,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-24 12:48:07,271 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:48:07,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:48:07,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1071113295, now seen corresponding path program 1 times [2024-10-24 12:48:07,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:48:07,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412558467] [2024-10-24 12:48:07,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:48:07,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:48:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:09,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:09,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:48:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:09,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:09,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 12:48:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:10,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:10,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 12:48:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:10,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 12:48:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:10,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 12:48:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 12:48:10,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:48:10,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412558467] [2024-10-24 12:48:10,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412558467] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:48:10,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564697185] [2024-10-24 12:48:10,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:48:10,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:48:10,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:48:10,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:48:10,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 12:48:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:11,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 2489 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-24 12:48:11,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:48:11,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-10-24 12:48:11,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2024-10-24 12:48:11,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 7 [2024-10-24 12:48:11,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2024-10-24 12:48:11,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 57 [2024-10-24 12:48:11,639 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 12:48:11,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 94 [2024-10-24 12:48:11,679 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 12:48:11,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20 [2024-10-24 12:48:11,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2024-10-24 12:48:13,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 12:48:13,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 121 treesize of output 173 [2024-10-24 12:48:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:48:18,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:48:18,997 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 12:48:18,999 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-24 12:48:19,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2024-10-24 12:48:19,513 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-10-24 12:48:19,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-24 12:48:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 12:48:19,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564697185] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 12:48:19,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 12:48:19,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 15] total 46 [2024-10-24 12:48:19,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019412265] [2024-10-24 12:48:19,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 12:48:19,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-24 12:48:19,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:48:19,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-24 12:48:19,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1896, Unknown=0, NotChecked=0, Total=2070 [2024-10-24 12:48:19,547 INFO L87 Difference]: Start difference. First operand 164 states and 193 transitions. Second operand has 46 states, 37 states have (on average 2.6216216216216215) internal successors, (97), 37 states have internal predecessors, (97), 11 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) [2024-10-24 12:48:27,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:48:27,298 INFO L93 Difference]: Finished difference Result 262 states and 300 transitions. [2024-10-24 12:48:27,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-24 12:48:27,298 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 37 states have (on average 2.6216216216216215) internal successors, (97), 37 states have internal predecessors, (97), 11 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) Word has length 61 [2024-10-24 12:48:27,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:48:27,300 INFO L225 Difference]: With dead ends: 262 [2024-10-24 12:48:27,300 INFO L226 Difference]: Without dead ends: 218 [2024-10-24 12:48:27,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=709, Invalid=4693, Unknown=0, NotChecked=0, Total=5402 [2024-10-24 12:48:27,302 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 381 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 2766 mSolverCounterSat, 135 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 2766 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-24 12:48:27,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 320 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 2766 Invalid, 14 Unknown, 0 Unchecked, 3.6s Time] [2024-10-24 12:48:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-24 12:48:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 131. [2024-10-24 12:48:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 95 states have (on average 1.1263157894736842) internal successors, (107), 99 states have internal predecessors, (107), 19 states have call successors, (19), 12 states have call predecessors, (19), 16 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2024-10-24 12:48:27,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2024-10-24 12:48:27,334 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 61 [2024-10-24 12:48:27,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:48:27,335 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2024-10-24 12:48:27,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 37 states have (on average 2.6216216216216215) internal successors, (97), 37 states have internal predecessors, (97), 11 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) [2024-10-24 12:48:27,335 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2024-10-24 12:48:27,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 12:48:27,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:48:27,336 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:48:27,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 12:48:27,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-24 12:48:27,537 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:48:27,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:48:27,537 INFO L85 PathProgramCache]: Analyzing trace with hash -897511745, now seen corresponding path program 1 times [2024-10-24 12:48:27,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:48:27,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432254365] [2024-10-24 12:48:27,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:48:27,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:48:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:28,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:28,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:48:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:28,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:28,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 12:48:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:28,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:28,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 12:48:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:28,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 12:48:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:28,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 12:48:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:28,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:48:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 12:48:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:48:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432254365] [2024-10-24 12:48:28,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432254365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:48:28,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:48:28,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 12:48:28,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789938428] [2024-10-24 12:48:28,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:48:28,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 12:48:28,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:48:28,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 12:48:28,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:48:28,675 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand has 12 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-24 12:48:29,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:48:29,100 INFO L93 Difference]: Finished difference Result 137 states and 154 transitions. [2024-10-24 12:48:29,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 12:48:29,101 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 63 [2024-10-24 12:48:29,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:48:29,102 INFO L225 Difference]: With dead ends: 137 [2024-10-24 12:48:29,102 INFO L226 Difference]: Without dead ends: 135 [2024-10-24 12:48:29,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-10-24 12:48:29,103 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 73 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:48:29,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 174 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:48:29,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-24 12:48:29,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-24 12:48:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 98 states have (on average 1.1224489795918366) internal successors, (110), 102 states have internal predecessors, (110), 19 states have call successors, (19), 13 states have call predecessors, (19), 17 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2024-10-24 12:48:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2024-10-24 12:48:29,128 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 63 [2024-10-24 12:48:29,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:48:29,129 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2024-10-24 12:48:29,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-24 12:48:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2024-10-24 12:48:29,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 12:48:29,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:48:29,130 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:48:29,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 12:48:29,130 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:48:29,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:48:29,130 INFO L85 PathProgramCache]: Analyzing trace with hash -685543068, now seen corresponding path program 1 times [2024-10-24 12:48:29,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:48:29,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977059433] [2024-10-24 12:48:29,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:48:29,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:48:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:29,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:29,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:48:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:29,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:29,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 12:48:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:29,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:29,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 12:48:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:29,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 12:48:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:29,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 12:48:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 12:48:29,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:48:29,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977059433] [2024-10-24 12:48:29,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977059433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:48:29,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:48:29,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 12:48:29,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744412686] [2024-10-24 12:48:29,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:48:29,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 12:48:29,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:48:29,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 12:48:29,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:48:29,823 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 12:48:30,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:48:30,250 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2024-10-24 12:48:30,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 12:48:30,250 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2024-10-24 12:48:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:48:30,251 INFO L225 Difference]: With dead ends: 158 [2024-10-24 12:48:30,251 INFO L226 Difference]: Without dead ends: 156 [2024-10-24 12:48:30,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-10-24 12:48:30,252 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 75 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:48:30,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 275 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:48:30,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-24 12:48:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 147. [2024-10-24 12:48:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 108 states have (on average 1.1111111111111112) internal successors, (120), 114 states have internal predecessors, (120), 19 states have call successors, (19), 13 states have call predecessors, (19), 19 states have return successors, (26), 19 states have call predecessors, (26), 18 states have call successors, (26) [2024-10-24 12:48:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 165 transitions. [2024-10-24 12:48:30,286 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 165 transitions. Word has length 63 [2024-10-24 12:48:30,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:48:30,286 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 165 transitions. [2024-10-24 12:48:30,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 12:48:30,286 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 165 transitions. [2024-10-24 12:48:30,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 12:48:30,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:48:30,287 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:48:30,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 12:48:30,288 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:48:30,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:48:30,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1078570078, now seen corresponding path program 1 times [2024-10-24 12:48:30,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:48:30,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823376474] [2024-10-24 12:48:30,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:48:30,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:48:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:31,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:31,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:48:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:31,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:31,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 12:48:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:31,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:31,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 12:48:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:32,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 12:48:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:32,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 12:48:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 12:48:32,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:48:32,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823376474] [2024-10-24 12:48:32,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823376474] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:48:32,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021503201] [2024-10-24 12:48:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:48:32,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:48:32,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:48:32,332 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:48:32,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 12:48:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:32,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 2496 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-24 12:48:32,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:48:32,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1