./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_stateful-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:58:42,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:58:42,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:58:42,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:58:42,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:58:42,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:58:42,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:58:42,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:58:43,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:58:43,002 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:58:43,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:58:43,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:58:43,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:58:43,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:58:43,007 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:58:43,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:58:43,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:58:43,008 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:58:43,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:58:43,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:58:43,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:58:43,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:58:43,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:58:43,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:58:43,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:58:43,010 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:58:43,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:58:43,011 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:58:43,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:58:43,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:58:43,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:58:43,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:58:43,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:58:43,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:58:43,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:58:43,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:58:43,015 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:58:43,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:58:43,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:58:43,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:58:43,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:58:43,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:58:43,016 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-clean/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-clean/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 -> 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e [2024-10-11 03:58:43,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:58:43,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:58:43,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:58:43,342 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:58:43,343 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:58:43,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2024-10-11 03:58:44,774 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:58:45,063 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:58:45,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2024-10-11 03:58:45,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/20b4c72ed/fa529fe4e2ee4ffda53070a40dc248d9/FLAG3debc19ec [2024-10-11 03:58:45,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/20b4c72ed/fa529fe4e2ee4ffda53070a40dc248d9 [2024-10-11 03:58:45,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:58:45,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:58:45,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:58:45,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:58:45,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:58:45,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:58:45" (1/1) ... [2024-10-11 03:58:45,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aa84045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:45, skipping insertion in model container [2024-10-11 03:58:45,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:58:45" (1/1) ... [2024-10-11 03:58:45,409 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:58:45,768 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_stateful-1.i[23400,23413] [2024-10-11 03:58:45,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:58:45,921 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:58:45,957 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_stateful-1.i[23400,23413] [2024-10-11 03:58:46,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:58:46,100 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:58:46,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:46 WrapperNode [2024-10-11 03:58:46,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:58:46,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:58:46,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:58:46,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:58:46,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:46" (1/1) ... [2024-10-11 03:58:46,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:46" (1/1) ... [2024-10-11 03:58:46,210 INFO L138 Inliner]: procedures = 144, calls = 231, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 570 [2024-10-11 03:58:46,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:58:46,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:58:46,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:58:46,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:58:46,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:46" (1/1) ... [2024-10-11 03:58:46,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:46" (1/1) ... [2024-10-11 03:58:46,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:46" (1/1) ... [2024-10-11 03:58:46,285 INFO L175 MemorySlicer]: Split 112 memory accesses to 16 slices as follows [2, 7, 8, 8, 20, 12, 10, 10, 3, 7, 3, 4, 3, 12, 0, 3]. 18 percent of accesses are in the largest equivalence class. The 28 initializations are split as follows [2, 0, 3, 3, 6, 6, 2, 2, 0, 0, 0, 0, 0, 4, 0, 0]. The 35 writes are split as follows [0, 1, 2, 2, 8, 3, 4, 4, 1, 1, 1, 2, 1, 4, 0, 1]. [2024-10-11 03:58:46,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:46" (1/1) ... [2024-10-11 03:58:46,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:46" (1/1) ... [2024-10-11 03:58:46,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:46" (1/1) ... [2024-10-11 03:58:46,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:46" (1/1) ... [2024-10-11 03:58:46,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:46" (1/1) ... [2024-10-11 03:58:46,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:46" (1/1) ... [2024-10-11 03:58:46,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:58:46,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:58:46,368 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:58:46,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:58:46,369 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:46" (1/1) ... [2024-10-11 03:58:46,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:58:46,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:58:46,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:58:46,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:58:46,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 03:58:46,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 03:58:46,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 03:58:46,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 03:58:46,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 03:58:46,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 03:58:46,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 03:58:46,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 03:58:46,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 03:58:46,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 03:58:46,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 03:58:46,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 03:58:46,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 03:58:46,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-11 03:58:46,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-11 03:58:46,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-11 03:58:46,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 03:58:46,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 03:58:46,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 03:58:46,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 03:58:46,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 03:58:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 03:58:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 03:58:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 03:58:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 03:58:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 03:58:46,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 03:58:46,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 03:58:46,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 03:58:46,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-11 03:58:46,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-11 03:58:46,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-11 03:58:46,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:58:46,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 03:58:46,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 03:58:46,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 03:58:46,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 03:58:46,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 03:58:46,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 03:58:46,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 03:58:46,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 03:58:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 03:58:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-11 03:58:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-11 03:58:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-11 03:58:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-11 03:58:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-11 03:58:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-11 03:58:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-10-11 03:58:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-10-11 03:58:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2024-10-11 03:58:46,477 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2024-10-11 03:58:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2024-10-11 03:58:46,478 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2024-10-11 03:58:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-10-11 03:58:46,478 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-10-11 03:58:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 03:58:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 03:58:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 03:58:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 03:58:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 03:58:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 03:58:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 03:58:46,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 03:58:46,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-11 03:58:46,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-11 03:58:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-11 03:58:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-11 03:58:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-11 03:58:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-11 03:58:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-10-11 03:58:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-10-11 03:58:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-10-11 03:58:46,481 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-10-11 03:58:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-10-11 03:58:46,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-10-11 03:58:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 03:58:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 03:58:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 03:58:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 03:58:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 03:58:46,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 03:58:46,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 03:58:46,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 03:58:46,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 03:58:46,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-11 03:58:46,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-11 03:58:46,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-11 03:58:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-11 03:58:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-11 03:58:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-11 03:58:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-10-11 03:58:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-10-11 03:58:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-10-11 03:58:46,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-10-11 03:58:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:58:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 03:58:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 03:58:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 03:58:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 03:58:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 03:58:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 03:58:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 03:58:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 03:58:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 03:58:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 03:58:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 03:58:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 03:58:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 03:58:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 03:58:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 03:58:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2024-10-11 03:58:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2024-10-11 03:58:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:58:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:58:46,786 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:58:46,788 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:58:47,232 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: SUMMARY for call __CS_cs(); srcloc: null [2024-10-11 03:58:47,233 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-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-11 03:58:47,233 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-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-11 03:58:47,233 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-11 03:58:47,233 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: 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-11 03:58:47,233 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-11 03:58:47,233 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);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-11 03:58:47,661 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-10-11 03:58:47,662 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:58:47,722 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:58:47,722 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 03:58:47,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:58:47 BoogieIcfgContainer [2024-10-11 03:58:47,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:58:47,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:58:47,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:58:47,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:58:47,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:58:45" (1/3) ... [2024-10-11 03:58:47,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478e3d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:58:47, skipping insertion in model container [2024-10-11 03:58:47,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:46" (2/3) ... [2024-10-11 03:58:47,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478e3d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:58:47, skipping insertion in model container [2024-10-11 03:58:47,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:58:47" (3/3) ... [2024-10-11 03:58:47,732 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_stateful-1.i [2024-10-11 03:58:47,752 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:58:47,752 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:58:47,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:58:47,847 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;@2d5c0309, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:58:47,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:58:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 109 states have (on average 1.5504587155963303) internal successors, (169), 110 states have internal predecessors, (169), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 03:58:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 03:58:47,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:58:47,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:58:47,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:58:47,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:58:47,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1924643995, now seen corresponding path program 1 times [2024-10-11 03:58:47,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:58:47,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695932654] [2024-10-11 03:58:47,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:58:47,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:58:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:58:48,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:58:48,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695932654] [2024-10-11 03:58:48,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695932654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:58:48,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:58:48,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:58:48,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928500279] [2024-10-11 03:58:48,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:58:48,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:58:48,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:58:48,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:58:48,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:58:48,481 INFO L87 Difference]: Start difference. First operand has 160 states, 109 states have (on average 1.5504587155963303) internal successors, (169), 110 states have internal predecessors, (169), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:58:48,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:58:48,669 INFO L93 Difference]: Finished difference Result 322 states and 542 transitions. [2024-10-11 03:58:48,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:58:48,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-11 03:58:48,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:58:48,687 INFO L225 Difference]: With dead ends: 322 [2024-10-11 03:58:48,687 INFO L226 Difference]: Without dead ends: 161 [2024-10-11 03:58:48,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 03:58:48,698 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 3 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 454 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-11 03:58:48,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 454 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:58:48,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-11 03:58:48,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2024-10-11 03:58:48,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 109 states have internal predecessors, (153), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 03:58:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 237 transitions. [2024-10-11 03:58:48,756 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 237 transitions. Word has length 31 [2024-10-11 03:58:48,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:58:48,757 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 237 transitions. [2024-10-11 03:58:48,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:58:48,757 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 237 transitions. [2024-10-11 03:58:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:58:48,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:58:48,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:58:48,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:58:48,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:58:48,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:58:48,766 INFO L85 PathProgramCache]: Analyzing trace with hash 883927435, now seen corresponding path program 1 times [2024-10-11 03:58:48,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:58:48,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829803381] [2024-10-11 03:58:48,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:58:48,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:58:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:49,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:58:49,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:58:49,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829803381] [2024-10-11 03:58:49,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829803381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:58:49,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:58:49,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:58:49,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247349247] [2024-10-11 03:58:49,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:58:49,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:58:49,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:58:49,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:58:49,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:58:49,015 INFO L87 Difference]: Start difference. First operand 159 states and 237 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:58:49,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:58:49,105 INFO L93 Difference]: Finished difference Result 317 states and 474 transitions. [2024-10-11 03:58:49,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:58:49,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 03:58:49,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:58:49,108 INFO L225 Difference]: With dead ends: 317 [2024-10-11 03:58:49,109 INFO L226 Difference]: Without dead ends: 160 [2024-10-11 03:58:49,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 03:58:49,111 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:58:49,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:58:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-11 03:58:49,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-10-11 03:58:49,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 110 states have (on average 1.4) internal successors, (154), 110 states have internal predecessors, (154), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 03:58:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 238 transitions. [2024-10-11 03:58:49,129 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 238 transitions. Word has length 34 [2024-10-11 03:58:49,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:58:49,129 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 238 transitions. [2024-10-11 03:58:49,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:58:49,129 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 238 transitions. [2024-10-11 03:58:49,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 03:58:49,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:58:49,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:58:49,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:58:49,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:58:49,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:58:49,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1135062502, now seen corresponding path program 1 times [2024-10-11 03:58:49,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:58:49,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80167757] [2024-10-11 03:58:49,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:58:49,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:58:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:49,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:58:49,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:58:49,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80167757] [2024-10-11 03:58:49,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80167757] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:58:49,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175349624] [2024-10-11 03:58:49,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:58:49,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:58:49,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:58:49,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:58:49,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:58:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:49,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 03:58:49,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:58:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:58:49,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:58:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:58:49,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175349624] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:58:49,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:58:49,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-11 03:58:49,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987001493] [2024-10-11 03:58:49,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:58:49,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:58:49,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:58:49,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:58:49,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:58:49,854 INFO L87 Difference]: Start difference. First operand 160 states and 238 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:58:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:58:49,986 INFO L93 Difference]: Finished difference Result 320 states and 478 transitions. [2024-10-11 03:58:49,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:58:49,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-11 03:58:49,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:58:49,990 INFO L225 Difference]: With dead ends: 320 [2024-10-11 03:58:49,990 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 03:58:49,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 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-11 03:58:49,995 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:58:49,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 906 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:58:49,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 03:58:50,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-11 03:58:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 112 states have internal predecessors, (156), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 03:58:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 240 transitions. [2024-10-11 03:58:50,021 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 240 transitions. Word has length 35 [2024-10-11 03:58:50,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:58:50,021 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 240 transitions. [2024-10-11 03:58:50,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:58:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 240 transitions. [2024-10-11 03:58:50,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 03:58:50,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:58:50,028 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:58:50,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 03:58:50,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:58:50,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:58:50,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:58:50,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1152945798, now seen corresponding path program 2 times [2024-10-11 03:58:50,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:58:50,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513928434] [2024-10-11 03:58:50,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:58:50,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:58:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:50,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:58:50,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:58:50,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513928434] [2024-10-11 03:58:50,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513928434] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:58:50,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857294861] [2024-10-11 03:58:50,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:58:50,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:58:50,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:58:50,459 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:58:50,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:58:50,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 03:58:50,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:58:50,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 03:58:50,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:58:50,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 03:58:50,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 24 [2024-10-11 03:58:50,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2024-10-11 03:58:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 03:58:51,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:58:51,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857294861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:58:51,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:58:51,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2024-10-11 03:58:51,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547146481] [2024-10-11 03:58:51,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:58:51,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:58:51,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:58:51,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:58:51,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:58:51,125 INFO L87 Difference]: Start difference. First operand 162 states and 240 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:58:52,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:58:52,969 INFO L93 Difference]: Finished difference Result 462 states and 711 transitions. [2024-10-11 03:58:52,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:58:52,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-11 03:58:52,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:58:52,978 INFO L225 Difference]: With dead ends: 462 [2024-10-11 03:58:52,979 INFO L226 Difference]: Without dead ends: 412 [2024-10-11 03:58:52,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:58:52,981 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 504 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:58:52,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1027 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 03:58:52,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-11 03:58:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 287. [2024-10-11 03:58:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 189 states have (on average 1.439153439153439) internal successors, (272), 189 states have internal predecessors, (272), 83 states have call successors, (83), 14 states have call predecessors, (83), 14 states have return successors, (91), 83 states have call predecessors, (91), 83 states have call successors, (91) [2024-10-11 03:58:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 446 transitions. [2024-10-11 03:58:53,045 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 446 transitions. Word has length 37 [2024-10-11 03:58:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:58:53,046 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 446 transitions. [2024-10-11 03:58:53,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:58:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 446 transitions. [2024-10-11 03:58:53,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 03:58:53,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:58:53,053 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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-11 03:58:53,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:58:53,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:58:53,254 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:58:53,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:58:53,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1022568785, now seen corresponding path program 1 times [2024-10-11 03:58:53,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:58:53,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267527604] [2024-10-11 03:58:53,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:58:53,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:58:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:53,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:58:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:53,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:58:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:53,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:58:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:53,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 03:58:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:53,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:58:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:53,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:58:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:53,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 03:58:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 03:58:53,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:58:53,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267527604] [2024-10-11 03:58:53,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267527604] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:58:53,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657935139] [2024-10-11 03:58:53,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:58:53,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:58:53,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:58:53,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:58:53,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:58:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:54,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 03:58:54,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:58:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 03:58:54,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:58:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 03:58:54,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657935139] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:58:54,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:58:54,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 4] total 9 [2024-10-11 03:58:54,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727385700] [2024-10-11 03:58:54,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:58:54,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:58:54,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:58:54,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:58:54,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:58:54,328 INFO L87 Difference]: Start difference. First operand 287 states and 446 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 03:58:55,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 03:58:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:58:56,100 INFO L93 Difference]: Finished difference Result 582 states and 911 transitions. [2024-10-11 03:58:56,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:58:56,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 82 [2024-10-11 03:58:56,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:58:56,104 INFO L225 Difference]: With dead ends: 582 [2024-10-11 03:58:56,104 INFO L226 Difference]: Without dead ends: 303 [2024-10-11 03:58:56,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:58:56,107 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 76 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:58:56,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 927 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 03:58:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-11 03:58:56,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2024-10-11 03:58:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 197 states have (on average 1.4263959390862944) internal successors, (281), 199 states have internal predecessors, (281), 83 states have call successors, (83), 14 states have call predecessors, (83), 16 states have return successors, (97), 83 states have call predecessors, (97), 83 states have call successors, (97) [2024-10-11 03:58:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 461 transitions. [2024-10-11 03:58:56,152 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 461 transitions. Word has length 82 [2024-10-11 03:58:56,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:58:56,153 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 461 transitions. [2024-10-11 03:58:56,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 03:58:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 461 transitions. [2024-10-11 03:58:56,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 03:58:56,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:58:56,158 INFO L215 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 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] [2024-10-11 03:58:56,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 03:58:56,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:58:56,358 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:58:56,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:58:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash 687377012, now seen corresponding path program 2 times [2024-10-11 03:58:56,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:58:56,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793208508] [2024-10-11 03:58:56,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:58:56,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:58:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:58:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:58:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:58:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 03:58:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:58:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:58:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 03:58:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:58:57,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:58:57,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793208508] [2024-10-11 03:58:57,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793208508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:58:57,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:58:57,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:58:57,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506342702] [2024-10-11 03:58:57,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:58:57,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:58:57,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:58:57,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:58:57,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:58:57,159 INFO L87 Difference]: Start difference. First operand 297 states and 461 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:58:58,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:58:58,321 INFO L93 Difference]: Finished difference Result 847 states and 1337 transitions. [2024-10-11 03:58:58,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:58:58,322 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 88 [2024-10-11 03:58:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:58:58,328 INFO L225 Difference]: With dead ends: 847 [2024-10-11 03:58:58,328 INFO L226 Difference]: Without dead ends: 581 [2024-10-11 03:58:58,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:58:58,331 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 303 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:58:58,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 809 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:58:58,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-10-11 03:58:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 545. [2024-10-11 03:58:58,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 349 states have (on average 1.4584527220630372) internal successors, (509), 352 states have internal predecessors, (509), 163 states have call successors, (163), 28 states have call predecessors, (163), 32 states have return successors, (198), 164 states have call predecessors, (198), 163 states have call successors, (198) [2024-10-11 03:58:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 870 transitions. [2024-10-11 03:58:58,388 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 870 transitions. Word has length 88 [2024-10-11 03:58:58,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:58:58,389 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 870 transitions. [2024-10-11 03:58:58,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:58:58,389 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 870 transitions. [2024-10-11 03:58:58,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 03:58:58,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:58:58,392 INFO L215 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 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] [2024-10-11 03:58:58,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:58:58,392 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:58:58,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:58:58,392 INFO L85 PathProgramCache]: Analyzing trace with hash 598988510, now seen corresponding path program 1 times [2024-10-11 03:58:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:58:58,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763051819] [2024-10-11 03:58:58,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:58:58,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:58:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:59,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:58:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:59,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:58:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:59,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:58:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:59,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 03:58:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:59,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:58:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:59,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:58:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:59,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 03:58:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:58:59,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:58:59,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763051819] [2024-10-11 03:58:59,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763051819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:58:59,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:58:59,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:58:59,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225541147] [2024-10-11 03:58:59,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:58:59,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:58:59,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:58:59,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:58:59,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:58:59,130 INFO L87 Difference]: Start difference. First operand 545 states and 870 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:59:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:59:01,108 INFO L93 Difference]: Finished difference Result 1037 states and 1633 transitions. [2024-10-11 03:59:01,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:59:01,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 88 [2024-10-11 03:59:01,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:59:01,113 INFO L225 Difference]: With dead ends: 1037 [2024-10-11 03:59:01,114 INFO L226 Difference]: Without dead ends: 510 [2024-10-11 03:59:01,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:59:01,117 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 291 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:59:01,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 902 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 03:59:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-11 03:59:01,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 474. [2024-10-11 03:59:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 308 states have (on average 1.37012987012987) internal successors, (422), 310 states have internal predecessors, (422), 136 states have call successors, (136), 25 states have call predecessors, (136), 29 states have return successors, (160), 138 states have call predecessors, (160), 136 states have call successors, (160) [2024-10-11 03:59:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 718 transitions. [2024-10-11 03:59:01,173 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 718 transitions. Word has length 88 [2024-10-11 03:59:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:59:01,173 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 718 transitions. [2024-10-11 03:59:01,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:59:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 718 transitions. [2024-10-11 03:59:01,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 03:59:01,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:59:01,177 INFO L215 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 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] [2024-10-11 03:59:01,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:59:01,177 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:59:01,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:59:01,178 INFO L85 PathProgramCache]: Analyzing trace with hash 340002696, now seen corresponding path program 1 times [2024-10-11 03:59:01,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:59:01,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730355453] [2024-10-11 03:59:01,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:59:01,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:59:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:01,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:59:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:01,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:59:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:01,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:59:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:01,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 03:59:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:01,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:59:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:01,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:59:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:01,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 03:59:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:01,905 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:59:01,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:59:01,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730355453] [2024-10-11 03:59:01,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730355453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:59:01,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:59:01,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:59:01,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743993356] [2024-10-11 03:59:01,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:59:01,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:59:01,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:59:01,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:59:01,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:59:01,907 INFO L87 Difference]: Start difference. First operand 474 states and 718 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:59:05,982 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-11 03:59:10,848 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-11 03:59:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:59:12,276 INFO L93 Difference]: Finished difference Result 546 states and 804 transitions. [2024-10-11 03:59:12,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:59:12,277 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 88 [2024-10-11 03:59:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:59:12,280 INFO L225 Difference]: With dead ends: 546 [2024-10-11 03:59:12,281 INFO L226 Difference]: Without dead ends: 425 [2024-10-11 03:59:12,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:59:12,282 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 324 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 189 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:59:12,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 763 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 534 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2024-10-11 03:59:12,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-11 03:59:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 393. [2024-10-11 03:59:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 262 states have (on average 1.381679389312977) internal successors, (362), 265 states have internal predecessors, (362), 104 states have call successors, (104), 21 states have call predecessors, (104), 26 states have return successors, (129), 106 states have call predecessors, (129), 104 states have call successors, (129) [2024-10-11 03:59:12,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 595 transitions. [2024-10-11 03:59:12,325 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 595 transitions. Word has length 88 [2024-10-11 03:59:12,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:59:12,327 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 595 transitions. [2024-10-11 03:59:12,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:59:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 595 transitions. [2024-10-11 03:59:12,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 03:59:12,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:59:12,330 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:59:12,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:59:12,331 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:59:12,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:59:12,331 INFO L85 PathProgramCache]: Analyzing trace with hash -489189268, now seen corresponding path program 1 times [2024-10-11 03:59:12,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:59:12,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687828678] [2024-10-11 03:59:12,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:59:12,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:59:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:13,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:59:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:13,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:59:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:13,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 03:59:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:13,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:59:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:13,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:59:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:13,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 03:59:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:13,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 03:59:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:13,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:59:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:13,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 03:59:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:13,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:59:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:13,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:59:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:13,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:59:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:13,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:59:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:13,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:59:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-10-11 03:59:13,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:59:13,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687828678] [2024-10-11 03:59:13,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687828678] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:59:13,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034031941] [2024-10-11 03:59:13,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:59:13,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:59:13,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:59:13,590 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:59:13,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:59:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:14,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 1360 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 03:59:14,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:59:14,324 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-10-11 03:59:14,327 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:59:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-10-11 03:59:14,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034031941] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:59:14,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:59:14,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 16 [2024-10-11 03:59:14,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537944208] [2024-10-11 03:59:14,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:59:14,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 03:59:14,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:59:14,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 03:59:14,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:59:14,771 INFO L87 Difference]: Start difference. First operand 393 states and 595 transitions. Second operand has 16 states, 16 states have (on average 6.125) internal successors, (98), 12 states have internal predecessors, (98), 7 states have call successors, (35), 7 states have call predecessors, (35), 6 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) [2024-10-11 03:59:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:59:18,194 INFO L93 Difference]: Finished difference Result 1007 states and 1569 transitions. [2024-10-11 03:59:18,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 03:59:18,195 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 12 states have internal predecessors, (98), 7 states have call successors, (35), 7 states have call predecessors, (35), 6 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) Word has length 125 [2024-10-11 03:59:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:59:18,200 INFO L225 Difference]: With dead ends: 1007 [2024-10-11 03:59:18,200 INFO L226 Difference]: Without dead ends: 650 [2024-10-11 03:59:18,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2024-10-11 03:59:18,204 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 665 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:59:18,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 970 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 03:59:18,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-10-11 03:59:18,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 603. [2024-10-11 03:59:18,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 386 states have (on average 1.4119170984455958) internal successors, (545), 393 states have internal predecessors, (545), 174 states have call successors, (174), 36 states have call predecessors, (174), 42 states have return successors, (218), 173 states have call predecessors, (218), 174 states have call successors, (218) [2024-10-11 03:59:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 937 transitions. [2024-10-11 03:59:18,278 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 937 transitions. Word has length 125 [2024-10-11 03:59:18,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:59:18,279 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 937 transitions. [2024-10-11 03:59:18,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 12 states have internal predecessors, (98), 7 states have call successors, (35), 7 states have call predecessors, (35), 6 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) [2024-10-11 03:59:18,279 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 937 transitions. [2024-10-11 03:59:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 03:59:18,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:59:18,283 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:59:18,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 03:59:18,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 03:59:18,484 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:59:18,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:59:18,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1730320170, now seen corresponding path program 1 times [2024-10-11 03:59:18,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:59:18,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825489923] [2024-10-11 03:59:18,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:59:18,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:59:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:20,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:59:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:21,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:59:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:21,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 03:59:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:21,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:59:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:21,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:59:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:21,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 03:59:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:21,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 03:59:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:21,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:59:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:21,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 03:59:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:21,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:59:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:21,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:59:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:21,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:59:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:21,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:59:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:21,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:59:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-10-11 03:59:21,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:59:21,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825489923] [2024-10-11 03:59:21,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825489923] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:59:21,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168946952] [2024-10-11 03:59:21,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:59:21,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:59:21,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:59:21,652 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:59:21,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:59:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:22,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 03:59:22,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:59:22,488 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-11 03:59:22,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 03:59:22,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 03:59:22,635 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-11 03:59:22,729 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-11 03:59:22,729 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 [2024-10-11 03:59:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-11 03:59:47,645 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:59:47,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2024-10-11 03:59:47,818 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 35 treesize of output 31 [2024-10-11 03:59:48,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-10-11 03:59:48,281 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 26 treesize of output 22 [2024-10-11 03:59:48,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-10-11 03:59:48,360 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 26 treesize of output 22 [2024-10-11 03:59:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-10-11 03:59:48,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168946952] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:59:48,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:59:48,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 9] total 38 [2024-10-11 03:59:48,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929258490] [2024-10-11 03:59:48,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:59:48,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 03:59:48,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:59:48,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 03:59:48,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1269, Unknown=2, NotChecked=0, Total=1406 [2024-10-11 03:59:48,553 INFO L87 Difference]: Start difference. First operand 603 states and 937 transitions. Second operand has 38 states, 35 states have (on average 4.228571428571429) internal successors, (148), 34 states have internal predecessors, (148), 13 states have call successors, (42), 12 states have call predecessors, (42), 13 states have return successors, (42), 12 states have call predecessors, (42), 13 states have call successors, (42) [2024-10-11 03:59:52,821 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-11 03:59:55,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 03:59:56,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 04:00:01,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []