./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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/seq-pthread/cs_sync.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:39:20,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:39:20,124 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:39:20,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:39:20,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:39:20,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:39:20,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:39:20,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:39:20,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:39:20,164 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:39:20,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:39:20,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:39:20,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:39:20,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:39:20,166 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:39:20,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:39:20,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:39:20,168 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:39:20,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:39:20,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:39:20,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:39:20,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:39:20,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:39:20,173 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:39:20,173 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:39:20,173 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:39:20,173 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:39:20,174 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:39:20,174 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:39:20,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:39:20,175 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:39:20,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:39:20,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:39:20,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:39:20,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:39:20,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:39:20,176 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:39:20,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:39:20,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:39:20,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:39:20,177 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:39:20,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:39:20,178 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef [2024-10-12 20:39:20,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:39:20,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:39:20,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:39:20,486 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:39:20,487 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:39:20,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i [2024-10-12 20:39:21,865 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:39:22,133 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:39:22,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i [2024-10-12 20:39:22,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d70a461da/5065c5ba87d249ca98c8acf1bb903839/FLAG2b02304f6 [2024-10-12 20:39:22,440 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d70a461da/5065c5ba87d249ca98c8acf1bb903839 [2024-10-12 20:39:22,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:39:22,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:39:22,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:39:22,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:39:22,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:39:22,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:39:22" (1/1) ... [2024-10-12 20:39:22,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18cd60f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:22, skipping insertion in model container [2024-10-12 20:39:22,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:39:22" (1/1) ... [2024-10-12 20:39:22,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:39:22,961 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/seq-pthread/cs_sync.i[34698,34711] [2024-10-12 20:39:23,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:39:23,079 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:39:23,150 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/seq-pthread/cs_sync.i[34698,34711] [2024-10-12 20:39:23,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:39:23,284 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:39:23,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:23 WrapperNode [2024-10-12 20:39:23,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:39:23,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:39:23,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:39:23,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:39:23,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:23" (1/1) ... [2024-10-12 20:39:23,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:23" (1/1) ... [2024-10-12 20:39:23,359 INFO L138 Inliner]: procedures = 245, calls = 244, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 551 [2024-10-12 20:39:23,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:39:23,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:39:23,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:39:23,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:39:23,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:23" (1/1) ... [2024-10-12 20:39:23,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:23" (1/1) ... [2024-10-12 20:39:23,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:23" (1/1) ... [2024-10-12 20:39:23,431 INFO L175 MemorySlicer]: Split 118 memory accesses to 16 slices as follows [2, 8, 8, 3, 20, 16, 12, 6, 12, 0, 8, 3, 3, 3, 7, 7]. 17 percent of accesses are in the largest equivalence class. The 30 initializations are split as follows [2, 3, 3, 0, 6, 6, 2, 2, 2, 0, 4, 0, 0, 0, 0, 0]. The 36 writes are split as follows [0, 2, 2, 1, 8, 5, 4, 2, 5, 0, 2, 1, 1, 1, 1, 1]. [2024-10-12 20:39:23,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:23" (1/1) ... [2024-10-12 20:39:23,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:23" (1/1) ... [2024-10-12 20:39:23,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:23" (1/1) ... [2024-10-12 20:39:23,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:23" (1/1) ... [2024-10-12 20:39:23,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:23" (1/1) ... [2024-10-12 20:39:23,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:23" (1/1) ... [2024-10-12 20:39:23,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:39:23,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:39:23,519 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:39:23,520 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:39:23,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:23" (1/1) ... [2024-10-12 20:39:23,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:39:23,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:39:23,553 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-12 20:39:23,555 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-12 20:39:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 20:39:23,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 20:39:23,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 20:39:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_signal [2024-10-12 20:39:23,605 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_signal [2024-10-12 20:39:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2024-10-12 20:39:23,605 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2024-10-12 20:39:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 20:39:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 20:39:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-12 20:39:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-12 20:39:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-12 20:39:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-12 20:39:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-12 20:39:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-12 20:39:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-12 20:39:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-12 20:39:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-12 20:39:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-12 20:39:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-12 20:39:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-12 20:39:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-10-12 20:39:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-10-12 20:39:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 20:39:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-12 20:39:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-12 20:39:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-12 20:39:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-12 20:39:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-12 20:39:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-12 20:39:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-12 20:39:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-12 20:39:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-12 20:39:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-12 20:39:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-12 20:39:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-12 20:39:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-12 20:39:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-12 20:39:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-10-12 20:39:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-10-12 20:39:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2024-10-12 20:39:23,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2024-10-12 20:39:23,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 20:39:23,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 20:39:23,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 20:39:23,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-12 20:39:23,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-12 20:39:23,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-12 20:39:23,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-12 20:39:23,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-12 20:39:23,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-12 20:39:23,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-12 20:39:23,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-12 20:39:23,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-12 20:39:23,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-12 20:39:23,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-12 20:39:23,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-12 20:39:23,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-12 20:39:23,612 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_init [2024-10-12 20:39:23,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_init [2024-10-12 20:39:23,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 20:39:23,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 20:39:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 20:39:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-12 20:39:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-12 20:39:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-12 20:39:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-12 20:39:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-12 20:39:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-12 20:39:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-12 20:39:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-12 20:39:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-12 20:39:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-12 20:39:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-12 20:39:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-12 20:39:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-12 20:39:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:39:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 20:39:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 20:39:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-12 20:39:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-12 20:39:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-12 20:39:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-12 20:39:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-12 20:39:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-12 20:39:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-12 20:39:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-12 20:39:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-12 20:39:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-12 20:39:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-12 20:39:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-12 20:39:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-10-12 20:39:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-10-12 20:39:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-10-12 20:39:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-10-12 20:39:23,620 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_wait [2024-10-12 20:39:23,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_wait [2024-10-12 20:39:23,620 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-10-12 20:39:23,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-10-12 20:39:23,621 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-10-12 20:39:23,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-10-12 20:39:23,621 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-10-12 20:39:23,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-10-12 20:39:23,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:39:23,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 20:39:23,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 20:39:23,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 20:39:23,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 20:39:23,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-12 20:39:23,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-12 20:39:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-12 20:39:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-12 20:39:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-12 20:39:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-12 20:39:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-12 20:39:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-12 20:39:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-12 20:39:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-12 20:39:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-12 20:39:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:39:23,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:39:23,905 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:39:23,908 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:39:24,337 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:24,338 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2024-10-12 20:39:24,338 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:24,338 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2024-10-12 20:39:24,338 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: SUMMARY for call __CS_cs(); srcloc: null [2024-10-12 20:39:24,338 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2024-10-12 20:39:24,339 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:28,710 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-10-12 20:39:28,710 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:39:28,770 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:39:28,772 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-12 20:39:28,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:39:28 BoogieIcfgContainer [2024-10-12 20:39:28,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:39:28,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:39:28,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:39:28,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:39:28,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:39:22" (1/3) ... [2024-10-12 20:39:28,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1734d3f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:39:28, skipping insertion in model container [2024-10-12 20:39:28,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:23" (2/3) ... [2024-10-12 20:39:28,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1734d3f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:39:28, skipping insertion in model container [2024-10-12 20:39:28,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:39:28" (3/3) ... [2024-10-12 20:39:28,783 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_sync.i [2024-10-12 20:39:28,800 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:39:28,800 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:39:28,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:39:28,885 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;@7753d1da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:39:28,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:39:28,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 180 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 114 states have internal predecessors, (170), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-12 20:39:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 20:39:28,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:28,912 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:39:28,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:28,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:28,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1630962850, now seen corresponding path program 1 times [2024-10-12 20:39:28,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:28,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267315652] [2024-10-12 20:39:28,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:28,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:29,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:39:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:29,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:39:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:29,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:39:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:29,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 20:39:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:29,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 20:39:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:29,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 20:39:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:29,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:39:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:29,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 20:39:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:29,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 20:39:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:29,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 20:39:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-12 20:39:29,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:29,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267315652] [2024-10-12 20:39:29,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267315652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:29,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:39:29,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:39:29,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877780764] [2024-10-12 20:39:29,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:29,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:39:29,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:29,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:39:29,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:39:29,599 INFO L87 Difference]: Start difference. First operand has 180 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 114 states have internal predecessors, (170), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-12 20:39:29,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:29,774 INFO L93 Difference]: Finished difference Result 362 states and 611 transitions. [2024-10-12 20:39:29,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:39:29,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2024-10-12 20:39:29,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:29,788 INFO L225 Difference]: With dead ends: 362 [2024-10-12 20:39:29,789 INFO L226 Difference]: Without dead ends: 181 [2024-10-12 20:39:29,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:39:29,803 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 3 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:29,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 519 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:39:29,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-12 20:39:29,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2024-10-12 20:39:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 113 states have (on average 1.4336283185840708) internal successors, (162), 113 states have internal predecessors, (162), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-12 20:39:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 272 transitions. [2024-10-12 20:39:29,875 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 272 transitions. Word has length 71 [2024-10-12 20:39:29,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:29,876 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 272 transitions. [2024-10-12 20:39:29,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-12 20:39:29,876 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 272 transitions. [2024-10-12 20:39:29,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:39:29,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:29,886 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:39:29,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:39:29,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:29,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:29,888 INFO L85 PathProgramCache]: Analyzing trace with hash -449082393, now seen corresponding path program 1 times [2024-10-12 20:39:29,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:29,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233762867] [2024-10-12 20:39:29,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:29,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:39:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:39:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 20:39:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 20:39:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 20:39:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 20:39:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:39:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 20:39:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 20:39:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 20:39:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-12 20:39:30,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:30,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233762867] [2024-10-12 20:39:30,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233762867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:30,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:39:30,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:39:30,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106797564] [2024-10-12 20:39:30,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:30,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:39:30,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:30,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:39:30,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:39:30,219 INFO L87 Difference]: Start difference. First operand 179 states and 272 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-12 20:39:30,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:30,313 INFO L93 Difference]: Finished difference Result 357 states and 544 transitions. [2024-10-12 20:39:30,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:39:30,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 74 [2024-10-12 20:39:30,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:30,316 INFO L225 Difference]: With dead ends: 357 [2024-10-12 20:39:30,316 INFO L226 Difference]: Without dead ends: 180 [2024-10-12 20:39:30,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:39:30,318 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:30,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 520 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:39:30,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-12 20:39:30,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-10-12 20:39:30,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 114 states have internal predecessors, (163), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-12 20:39:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 273 transitions. [2024-10-12 20:39:30,340 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 273 transitions. Word has length 74 [2024-10-12 20:39:30,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:30,340 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 273 transitions. [2024-10-12 20:39:30,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-12 20:39:30,342 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 273 transitions. [2024-10-12 20:39:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 20:39:30,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:30,347 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:39:30,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:39:30,347 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:30,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:30,348 INFO L85 PathProgramCache]: Analyzing trace with hash 761248113, now seen corresponding path program 1 times [2024-10-12 20:39:30,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:30,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340400021] [2024-10-12 20:39:30,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:30,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 20:39:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:39:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:39:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:39:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:39:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:39:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:39:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 20:39:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 20:39:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 20:39:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-12 20:39:30,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:30,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340400021] [2024-10-12 20:39:30,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340400021] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:39:30,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063593850] [2024-10-12 20:39:30,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:30,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:39:30,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:39:30,643 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-12 20:39:30,644 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-12 20:39:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:30,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 20:39:31,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:39:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-12 20:39:31,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:39:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-12 20:39:31,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063593850] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:39:31,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:39:31,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-12 20:39:31,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377838480] [2024-10-12 20:39:31,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:39:31,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:39:31,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:31,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:39:31,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:39:31,121 INFO L87 Difference]: Start difference. First operand 180 states and 273 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-12 20:39:31,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:31,227 INFO L93 Difference]: Finished difference Result 360 states and 548 transitions. [2024-10-12 20:39:31,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:39:31,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 75 [2024-10-12 20:39:31,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:31,232 INFO L225 Difference]: With dead ends: 360 [2024-10-12 20:39:31,232 INFO L226 Difference]: Without dead ends: 182 [2024-10-12 20:39:31,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:39:31,235 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:31,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1038 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:39:31,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-12 20:39:31,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-10-12 20:39:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 116 states have (on average 1.4224137931034482) internal successors, (165), 116 states have internal predecessors, (165), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-12 20:39:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 275 transitions. [2024-10-12 20:39:31,261 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 275 transitions. Word has length 75 [2024-10-12 20:39:31,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:31,262 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 275 transitions. [2024-10-12 20:39:31,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-12 20:39:31,263 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 275 transitions. [2024-10-12 20:39:31,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:39:31,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:31,265 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:39:31,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 20:39:31,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:39:31,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:31,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:31,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1181732815, now seen corresponding path program 2 times [2024-10-12 20:39:31,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:31,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775865011] [2024-10-12 20:39:31,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:31,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:31,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:39:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:31,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:39:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:31,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 20:39:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:31,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 20:39:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:31,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 20:39:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:31,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:39:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:31,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 20:39:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:31,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 20:39:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:31,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 20:39:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:31,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:39:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-10-12 20:39:31,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:31,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775865011] [2024-10-12 20:39:31,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775865011] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:39:31,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583708563] [2024-10-12 20:39:31,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 20:39:31,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:39:31,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:39:31,729 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-12 20:39:31,732 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-12 20:39:32,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 20:39:32,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 20:39:32,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 20:39:32,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:39:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-10-12 20:39:32,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:39:32,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583708563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:32,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:39:32,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 20:39:32,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547297712] [2024-10-12 20:39:32,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:32,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:39:32,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:32,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:39:32,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:39:32,230 INFO L87 Difference]: Start difference. First operand 182 states and 275 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-12 20:39:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:32,339 INFO L93 Difference]: Finished difference Result 353 states and 544 transitions. [2024-10-12 20:39:32,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:39:32,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 77 [2024-10-12 20:39:32,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:32,345 INFO L225 Difference]: With dead ends: 353 [2024-10-12 20:39:32,347 INFO L226 Difference]: Without dead ends: 327 [2024-10-12 20:39:32,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:39:32,348 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 219 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:32,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 892 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:39:32,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-12 20:39:32,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2024-10-12 20:39:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 207 states have (on average 1.4492753623188406) internal successors, (300), 207 states have internal predecessors, (300), 99 states have call successors, (99), 20 states have call predecessors, (99), 20 states have return successors, (107), 99 states have call predecessors, (107), 99 states have call successors, (107) [2024-10-12 20:39:32,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 506 transitions. [2024-10-12 20:39:32,381 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 506 transitions. Word has length 77 [2024-10-12 20:39:32,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:32,381 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 506 transitions. [2024-10-12 20:39:32,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-12 20:39:32,382 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 506 transitions. [2024-10-12 20:39:32,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-12 20:39:32,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:32,385 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:39:32,404 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-12 20:39:32,585 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,SelfDestructingSolverStorable3 [2024-10-12 20:39:32,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:32,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:32,587 INFO L85 PathProgramCache]: Analyzing trace with hash -218609914, now seen corresponding path program 1 times [2024-10-12 20:39:32,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:32,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13624016] [2024-10-12 20:39:32,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:32,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:39:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 20:39:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:39:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:39:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:39:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 20:39:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 20:39:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 20:39:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 20:39:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 20:39:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 20:39:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:39:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 20:39:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 20:39:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-12 20:39:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 20:39:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:39:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2024-10-12 20:39:33,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:33,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13624016] [2024-10-12 20:39:33,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13624016] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:39:33,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830440089] [2024-10-12 20:39:33,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:33,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:39:33,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:39:33,197 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-12 20:39:33,198 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-12 20:39:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:33,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 20:39:33,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:39:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2024-10-12 20:39:33,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:39:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2024-10-12 20:39:33,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830440089] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:39:33,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:39:33,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 4] total 9 [2024-10-12 20:39:33,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016795148] [2024-10-12 20:39:33,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:39:33,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:39:33,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:33,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:39:33,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:39:33,925 INFO L87 Difference]: Start difference. First operand 327 states and 506 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-12 20:39:38,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:42,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:42,784 INFO L93 Difference]: Finished difference Result 672 states and 1041 transitions. [2024-10-12 20:39:42,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:39:42,785 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 166 [2024-10-12 20:39:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:42,789 INFO L225 Difference]: With dead ends: 672 [2024-10-12 20:39:42,789 INFO L226 Difference]: Without dead ends: 353 [2024-10-12 20:39:42,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 374 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:39:42,793 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 110 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 165 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:42,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 658 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 477 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-10-12 20:39:42,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-12 20:39:42,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 337. [2024-10-12 20:39:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 215 states have (on average 1.4372093023255814) internal successors, (309), 217 states have internal predecessors, (309), 99 states have call successors, (99), 20 states have call predecessors, (99), 22 states have return successors, (111), 99 states have call predecessors, (111), 99 states have call successors, (111) [2024-10-12 20:39:42,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 519 transitions. [2024-10-12 20:39:42,838 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 519 transitions. Word has length 166 [2024-10-12 20:39:42,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:42,838 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 519 transitions. [2024-10-12 20:39:42,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-12 20:39:42,839 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 519 transitions. [2024-10-12 20:39:42,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:39:42,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:42,845 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:39:42,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 20:39:43,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:39:43,046 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:43,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:43,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1952959059, now seen corresponding path program 1 times [2024-10-12 20:39:43,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:43,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262528930] [2024-10-12 20:39:43,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:43,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:39:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 20:39:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:39:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:39:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:39:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 20:39:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 20:39:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 20:39:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 20:39:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 20:39:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:39:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 20:39:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 20:39:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-12 20:39:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 20:39:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:39:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-12 20:39:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2024-10-12 20:39:43,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:43,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262528930] [2024-10-12 20:39:43,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262528930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:43,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:39:43,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:39:43,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364237457] [2024-10-12 20:39:43,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:43,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:39:43,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:43,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:39:43,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:39:43,924 INFO L87 Difference]: Start difference. First operand 337 states and 519 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-12 20:39:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:46,844 INFO L93 Difference]: Finished difference Result 987 states and 1535 transitions. [2024-10-12 20:39:46,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:39:46,845 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 172 [2024-10-12 20:39:46,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:46,853 INFO L225 Difference]: With dead ends: 987 [2024-10-12 20:39:46,853 INFO L226 Difference]: Without dead ends: 681 [2024-10-12 20:39:46,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:39:46,856 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 432 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:46,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 841 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 20:39:46,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-10-12 20:39:46,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 645. [2024-10-12 20:39:46,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 405 states have (on average 1.4444444444444444) internal successors, (585), 409 states have internal predecessors, (585), 195 states have call successors, (195), 40 states have call predecessors, (195), 44 states have return successors, (226), 195 states have call predecessors, (226), 195 states have call successors, (226) [2024-10-12 20:39:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1006 transitions. [2024-10-12 20:39:46,960 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1006 transitions. Word has length 172 [2024-10-12 20:39:46,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:46,960 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 1006 transitions. [2024-10-12 20:39:46,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-12 20:39:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1006 transitions. [2024-10-12 20:39:46,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:39:46,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:46,965 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:39:46,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:39:46,965 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:46,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:46,966 INFO L85 PathProgramCache]: Analyzing trace with hash -945954003, now seen corresponding path program 1 times [2024-10-12 20:39:46,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:46,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26563525] [2024-10-12 20:39:46,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:46,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:39:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 20:39:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:39:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:39:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:39:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 20:39:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 20:39:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:47,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 20:39:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 20:39:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 20:39:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:39:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 20:39:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 20:39:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-12 20:39:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 20:39:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:39:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-12 20:39:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2024-10-12 20:39:48,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:48,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26563525] [2024-10-12 20:39:48,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26563525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:48,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:39:48,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:39:48,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602271987] [2024-10-12 20:39:48,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:48,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:39:48,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:48,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:39:48,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:39:48,053 INFO L87 Difference]: Start difference. First operand 645 states and 1006 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-12 20:39:49,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:49,916 INFO L93 Difference]: Finished difference Result 1027 states and 1589 transitions. [2024-10-12 20:39:49,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 20:39:49,916 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 172 [2024-10-12 20:39:49,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:49,922 INFO L225 Difference]: With dead ends: 1027 [2024-10-12 20:39:49,922 INFO L226 Difference]: Without dead ends: 654 [2024-10-12 20:39:49,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2024-10-12 20:39:49,925 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 476 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:49,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 682 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:39:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-10-12 20:39:49,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 616. [2024-10-12 20:39:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 390 states have (on average 1.4307692307692308) internal successors, (558), 396 states have internal predecessors, (558), 180 states have call successors, (180), 38 states have call predecessors, (180), 45 states have return successors, (211), 181 states have call predecessors, (211), 180 states have call successors, (211) [2024-10-12 20:39:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 949 transitions. [2024-10-12 20:39:49,984 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 949 transitions. Word has length 172 [2024-10-12 20:39:49,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:49,985 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 949 transitions. [2024-10-12 20:39:49,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-12 20:39:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 949 transitions. [2024-10-12 20:39:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:39:49,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:49,989 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:39:49,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:39:49,989 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:49,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:49,990 INFO L85 PathProgramCache]: Analyzing trace with hash 66236247, now seen corresponding path program 1 times [2024-10-12 20:39:49,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:49,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534706458] [2024-10-12 20:39:49,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:49,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:39:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 20:39:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:39:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:39:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:39:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 20:39:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 20:39:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 20:39:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 20:39:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 20:39:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:39:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 20:39:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 20:39:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-12 20:39:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 20:39:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:39:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-12 20:39:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,765 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2024-10-12 20:39:50,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:50,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534706458] [2024-10-12 20:39:50,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534706458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:50,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:39:50,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:39:50,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381608423] [2024-10-12 20:39:50,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:50,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:39:50,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:50,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:39:50,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:39:50,767 INFO L87 Difference]: Start difference. First operand 616 states and 949 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-12 20:39:52,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:54,097 INFO L93 Difference]: Finished difference Result 986 states and 1502 transitions. [2024-10-12 20:39:54,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:39:54,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 172 [2024-10-12 20:39:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:54,103 INFO L225 Difference]: With dead ends: 986 [2024-10-12 20:39:54,103 INFO L226 Difference]: Without dead ends: 595 [2024-10-12 20:39:54,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:39:54,105 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 384 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:54,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 842 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 20:39:54,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-10-12 20:39:54,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 564. [2024-10-12 20:39:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 355 states have (on average 1.371830985915493) internal successors, (487), 361 states have internal predecessors, (487), 168 states have call successors, (168), 35 states have call predecessors, (168), 40 states have return successors, (195), 167 states have call predecessors, (195), 168 states have call successors, (195) [2024-10-12 20:39:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 850 transitions. [2024-10-12 20:39:54,176 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 850 transitions. Word has length 172 [2024-10-12 20:39:54,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:54,176 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 850 transitions. [2024-10-12 20:39:54,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-12 20:39:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 850 transitions. [2024-10-12 20:39:54,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:39:54,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:54,180 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:39:54,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:39:54,180 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:54,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:54,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1517144640, now seen corresponding path program 1 times [2024-10-12 20:39:54,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:54,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56299385] [2024-10-12 20:39:54,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:54,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:55,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:39:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 20:39:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:39:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:39:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:39:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 20:39:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 20:39:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 20:39:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 20:39:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 20:39:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:39:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 20:39:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 20:39:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-12 20:39:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 20:39:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:39:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-12 20:39:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,502 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2024-10-12 20:39:56,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:56,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56299385] [2024-10-12 20:39:56,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56299385] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:39:56,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700563394] [2024-10-12 20:39:56,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:56,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:39:56,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:39:56,505 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:39:56,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 20:39:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:56,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 1220 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 20:39:57,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:39:57,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 20:39:57,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 20:39:57,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-12 20:39:57,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-12 20:39:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-12 20:39:57,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:39:57,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700563394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:57,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:39:57,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2024-10-12 20:39:57,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322799578] [2024-10-12 20:39:57,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:57,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:39:57,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:57,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:39:57,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:39:57,176 INFO L87 Difference]: Start difference. First operand 564 states and 850 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-12 20:39:57,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:57,660 INFO L93 Difference]: Finished difference Result 608 states and 905 transitions. [2024-10-12 20:39:57,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:39:57,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 172 [2024-10-12 20:39:57,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:57,664 INFO L225 Difference]: With dead ends: 608 [2024-10-12 20:39:57,665 INFO L226 Difference]: Without dead ends: 471 [2024-10-12 20:39:57,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:39:57,666 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 285 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:57,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 759 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:39:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-10-12 20:39:57,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 463. [2024-10-12 20:39:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 292 states have (on average 1.36986301369863) internal successors, (400), 296 states have internal predecessors, (400), 136 states have call successors, (136), 29 states have call predecessors, (136), 34 states have return successors, (159), 137 states have call predecessors, (159), 136 states have call successors, (159) [2024-10-12 20:39:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 695 transitions. [2024-10-12 20:39:57,713 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 695 transitions. Word has length 172 [2024-10-12 20:39:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:57,713 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 695 transitions. [2024-10-12 20:39:57,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-12 20:39:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 695 transitions. [2024-10-12 20:39:57,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-12 20:39:57,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:57,717 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:39:57,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 20:39:57,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:39:57,918 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:57,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:57,918 INFO L85 PathProgramCache]: Analyzing trace with hash 750474776, now seen corresponding path program 1 times [2024-10-12 20:39:57,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:57,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106767568] [2024-10-12 20:39:57,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:57,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:39:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:39:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:39:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:39:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 20:39:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 20:39:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 20:39:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 20:39:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 20:39:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 20:39:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 20:39:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 20:39:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:58,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 20:39:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:59,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 20:39:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:59,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:59,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:59,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-12 20:39:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:59,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-12 20:39:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:59,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-12 20:39:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:59,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-12 20:39:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:59,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-12 20:39:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:59,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-12 20:39:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:59,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-12 20:39:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:59,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-10-12 20:39:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:59,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-12 20:39:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:59,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-12 20:39:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2024-10-12 20:39:59,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:59,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106767568] [2024-10-12 20:39:59,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106767568] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:39:59,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936402421] [2024-10-12 20:39:59,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:59,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:39:59,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:39:59,072 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:39:59,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 20:39:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:59,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 1576 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 20:39:59,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:39:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 640 proven. 4 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-10-12 20:39:59,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:40:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1502 trivial. 0 not checked. [2024-10-12 20:40:00,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936402421] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:40:00,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:40:00,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 16 [2024-10-12 20:40:00,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176151294] [2024-10-12 20:40:00,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:40:00,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 20:40:00,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:40:00,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 20:40:00,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:40:00,327 INFO L87 Difference]: Start difference. First operand 463 states and 695 transitions. Second operand has 16 states, 16 states have (on average 5.875) internal successors, (94), 12 states have internal predecessors, (94), 9 states have call successors, (57), 8 states have call predecessors, (57), 7 states have return successors, (52), 7 states have call predecessors, (52), 9 states have call successors, (52) [2024-10-12 20:40:03,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:07,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:11,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:14,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:40:14,869 INFO L93 Difference]: Finished difference Result 1195 states and 1830 transitions. [2024-10-12 20:40:14,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-12 20:40:14,870 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.875) internal successors, (94), 12 states have internal predecessors, (94), 9 states have call successors, (57), 8 states have call predecessors, (57), 7 states have return successors, (52), 7 states have call predecessors, (52), 9 states have call successors, (52) Word has length 245 [2024-10-12 20:40:14,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:40:14,876 INFO L225 Difference]: With dead ends: 1195 [2024-10-12 20:40:14,876 INFO L226 Difference]: Without dead ends: 768 [2024-10-12 20:40:14,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2024-10-12 20:40:14,880 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 1200 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 846 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 846 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:40:14,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 944 Invalid, 2176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [846 Valid, 1328 Invalid, 2 Unknown, 0 Unchecked, 13.5s Time] [2024-10-12 20:40:14,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-10-12 20:40:14,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 723. [2024-10-12 20:40:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 453 states have (on average 1.3973509933774835) internal successors, (633), 460 states have internal predecessors, (633), 212 states have call successors, (212), 51 states have call predecessors, (212), 57 states have return successors, (252), 211 states have call predecessors, (252), 212 states have call successors, (252) [2024-10-12 20:40:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1097 transitions. [2024-10-12 20:40:14,993 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1097 transitions. Word has length 245 [2024-10-12 20:40:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:40:14,994 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1097 transitions. [2024-10-12 20:40:14,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.875) internal successors, (94), 12 states have internal predecessors, (94), 9 states have call successors, (57), 8 states have call predecessors, (57), 7 states have return successors, (52), 7 states have call predecessors, (52), 9 states have call successors, (52) [2024-10-12 20:40:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1097 transitions. [2024-10-12 20:40:14,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-12 20:40:14,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:40:14,999 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:40:15,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 20:40:15,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-12 20:40:15,200 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:40:15,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:40:15,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1960362262, now seen corresponding path program 1 times [2024-10-12 20:40:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:40:15,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952714589] [2024-10-12 20:40:15,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:40:15,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:40:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:16,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:40:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:17,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:40:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:40:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 20:40:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:40:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:40:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:40:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 20:40:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 20:40:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:40:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 20:40:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 20:40:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:40:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 20:40:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 20:40:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:40:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 20:40:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 20:40:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:40:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 20:40:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 20:40:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:40:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-12 20:40:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-12 20:40:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-12 20:40:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-12 20:40:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-12 20:40:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-12 20:40:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-12 20:40:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-10-12 20:40:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-12 20:40:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-12 20:40:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2024-10-12 20:40:18,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:40:18,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952714589] [2024-10-12 20:40:18,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952714589] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:40:18,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992925276] [2024-10-12 20:40:18,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:40:18,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:40:18,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:40:18,534 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:40:18,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 20:40:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:19,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 1662 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-12 20:40:19,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:40:19,428 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 13 treesize of output 9 [2024-10-12 20:40:30,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 20:40:30,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 20:40:30,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2024-10-12 20:40:34,864 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-12 20:40:34,864 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 1 case distinctions, treesize of input 25 treesize of output 24