./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_stack-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f673ebb9e7e04aacff207de4acfe748a76999a1319247236c14ae51e44f23889 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:39:01,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:39:01,689 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:39:01,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:39:01,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:39:01,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:39:01,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:39:01,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:39:01,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:39:01,739 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:39:01,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:39:01,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:39:01,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:39:01,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:39:01,742 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:39:01,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:39:01,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:39:01,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:39:01,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:39:01,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:39:01,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:39:01,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:39:01,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:39:01,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:39:01,748 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:39:01,748 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:39:01,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:39:01,749 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:39:01,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:39:01,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:39:01,749 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:39:01,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:39:01,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:39:01,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:39:01,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:39:01,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:39:01,751 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:39:01,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:39:01,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:39:01,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:39:01,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:39:01,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:39:01,753 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f673ebb9e7e04aacff207de4acfe748a76999a1319247236c14ae51e44f23889 [2024-10-12 20:39:02,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:39:02,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:39:02,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:39:02,052 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:39:02,052 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:39:02,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-1.i [2024-10-12 20:39:03,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:39:03,849 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:39:03,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-1.i [2024-10-12 20:39:03,875 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6882fbc27/d04aacda42334871b5619b61377e78ce/FLAG1f8e8bcd5 [2024-10-12 20:39:03,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6882fbc27/d04aacda42334871b5619b61377e78ce [2024-10-12 20:39:03,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:39:03,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:39:03,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:39:03,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:39:03,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:39:03,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:39:03" (1/1) ... [2024-10-12 20:39:03,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274dd55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:03, skipping insertion in model container [2024-10-12 20:39:03,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:39:03" (1/1) ... [2024-10-12 20:39:03,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:39:04,389 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_stack-1.i[34744,34757] [2024-10-12 20:39:04,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:39:04,499 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:39:04,558 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_stack-1.i[34744,34757] [2024-10-12 20:39:04,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:39:04,687 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:39:04,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04 WrapperNode [2024-10-12 20:39:04,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:39:04,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:39:04,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:39:04,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:39:04,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,779 INFO L138 Inliner]: procedures = 254, calls = 274, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 651 [2024-10-12 20:39:04,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:39:04,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:39:04,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:39:04,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:39:04,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,839 INFO L175 MemorySlicer]: Split 130 memory accesses to 17 slices as follows [2, 8, 8, 3, 7, 20, 3, 12, 12, 4, 5, 12, 7, 8, 13, 6, 0]. 15 percent of accesses are in the largest equivalence class. The 30 initializations are split as follows [2, 3, 3, 0, 0, 6, 0, 6, 2, 2, 2, 0, 0, 2, 0, 2, 0]. The 38 writes are split as follows [0, 2, 2, 1, 1, 8, 1, 3, 3, 1, 1, 2, 1, 3, 7, 2, 0]. [2024-10-12 20:39:04,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,867 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:39:04,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:39:04,918 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:39:04,918 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:39:04,919 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:39:04,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:39:04,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:39:04,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:39:05,002 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 20:39:05,003 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 20:39:05,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 20:39:05,003 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2024-10-12 20:39:05,003 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2024-10-12 20:39:05,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 20:39:05,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 20:39:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-12 20:39:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-12 20:39:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-12 20:39:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-12 20:39:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-12 20:39:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-12 20:39:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-12 20:39:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-12 20:39:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-12 20:39:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-12 20:39:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-12 20:39:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-12 20:39:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-10-12 20:39:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-10-12 20:39:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-10-12 20:39:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 20:39:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-12 20:39:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-12 20:39:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-12 20:39:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-12 20:39:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-12 20:39:05,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-12 20:39:05,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-12 20:39:05,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-12 20:39:05,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-12 20:39:05,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-12 20:39:05,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-12 20:39:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-12 20:39:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-12 20:39:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-12 20:39:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-10-12 20:39:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-10-12 20:39:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-10-12 20:39:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2024-10-12 20:39:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2024-10-12 20:39:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 20:39:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 20:39:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 20:39:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-12 20:39:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-12 20:39:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-12 20:39:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-12 20:39:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-12 20:39:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-12 20:39:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-12 20:39:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-12 20:39:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-12 20:39:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-12 20:39:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-12 20:39:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-12 20:39:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-12 20:39:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-10-12 20:39:05,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 20:39:05,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 20:39:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 20:39:05,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-12 20:39:05,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-12 20:39:05,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-12 20:39:05,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-12 20:39:05,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-12 20:39:05,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-12 20:39:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-12 20:39:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-12 20:39:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-12 20:39:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-12 20:39:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-12 20:39:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-12 20:39:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-12 20:39:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-10-12 20:39:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2024-10-12 20:39:05,052 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2024-10-12 20:39:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:39:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 20:39:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 20:39:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-12 20:39:05,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-12 20:39:05,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-12 20:39:05,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-12 20:39:05,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-12 20:39:05,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-12 20:39:05,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-12 20:39:05,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-12 20:39:05,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-12 20:39:05,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-12 20:39:05,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-12 20:39:05,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-12 20:39:05,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-10-12 20:39:05,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-10-12 20:39:05,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-10-12 20:39:05,056 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-10-12 20:39:05,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-10-12 20:39:05,056 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-10-12 20:39:05,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-10-12 20:39:05,056 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-10-12 20:39:05,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-10-12 20:39:05,056 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-12 20:39:05,056 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-12 20:39:05,056 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-10-12 20:39:05,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-10-12 20:39:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:39:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 20:39:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 20:39:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 20:39:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 20:39:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-12 20:39:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-12 20:39:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-12 20:39:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-12 20:39:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-12 20:39:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-12 20:39:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-12 20:39:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-12 20:39:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-12 20:39:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-12 20:39:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-12 20:39:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-12 20:39:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:39:05,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:39:05,414 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:39:05,416 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:39:05,449 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,449 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2024-10-12 20:39:05,925 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##97: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,926 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2024-10-12 20:39:05,926 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,926 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2024-10-12 20:39:05,926 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,927 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2024-10-12 20:39:05,927 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,927 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##42: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2024-10-12 20:39:05,927 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2024-10-12 20:39:05,927 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));pop_#res#1 := 0; [2024-10-12 20:39:05,927 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-2: SUMMARY for call __CS_cs(); srcloc: null [2024-10-12 20:39:05,927 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2024-10-12 20:39:05,927 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,940 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,940 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2024-10-12 20:39:05,940 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2024-10-12 20:39:05,940 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,940 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,940 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L933: SUMMARY for call __CS_cs(); srcloc: null [2024-10-12 20:39:05,941 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L933-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2024-10-12 20:39:05,941 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L933-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,941 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2024-10-12 20:39:10,258 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2024-10-12 20:39:10,258 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:39:10,372 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:39:10,373 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-12 20:39:10,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:39:10 BoogieIcfgContainer [2024-10-12 20:39:10,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:39:10,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:39:10,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:39:10,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:39:10,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:39:03" (1/3) ... [2024-10-12 20:39:10,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178222f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:39:10, skipping insertion in model container [2024-10-12 20:39:10,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (2/3) ... [2024-10-12 20:39:10,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178222f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:39:10, skipping insertion in model container [2024-10-12 20:39:10,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:39:10" (3/3) ... [2024-10-12 20:39:10,407 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_stack-1.i [2024-10-12 20:39:10,432 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:39:10,433 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:39:10,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:39:10,526 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;@201696c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:39:10,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:39:10,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 212 states, 128 states have (on average 1.578125) internal successors, (202), 131 states have internal predecessors, (202), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2024-10-12 20:39:10,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 20:39:10,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:10,565 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:39:10,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:10,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash 793737601, now seen corresponding path program 1 times [2024-10-12 20:39:10,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:10,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497640604] [2024-10-12 20:39:10,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:10,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 20:39:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 20:39:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:39:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 20:39:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 20:39:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 20:39:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:39:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 20:39:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 20:39:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 20:39:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:39:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 20:39:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 20:39:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 20:39:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,318 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-12 20:39:11,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:11,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497640604] [2024-10-12 20:39:11,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497640604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:11,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:39:11,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:39:11,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574630643] [2024-10-12 20:39:11,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:11,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:39:11,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:11,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:39:11,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:39:11,353 INFO L87 Difference]: Start difference. First operand has 212 states, 128 states have (on average 1.578125) internal successors, (202), 131 states have internal predecessors, (202), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-12 20:39:11,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:11,521 INFO L93 Difference]: Finished difference Result 428 states and 773 transitions. [2024-10-12 20:39:11,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:39:11,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-10-12 20:39:11,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:11,539 INFO L225 Difference]: With dead ends: 428 [2024-10-12 20:39:11,539 INFO L226 Difference]: Without dead ends: 215 [2024-10-12 20:39:11,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:39:11,555 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 6 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:11,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 655 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:39:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-12 20:39:11,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2024-10-12 20:39:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 128 states have (on average 1.515625) internal successors, (194), 130 states have internal predecessors, (194), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2024-10-12 20:39:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 340 transitions. [2024-10-12 20:39:11,619 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 340 transitions. Word has length 95 [2024-10-12 20:39:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:11,620 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 340 transitions. [2024-10-12 20:39:11,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-12 20:39:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 340 transitions. [2024-10-12 20:39:11,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 20:39:11,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:11,646 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:39:11,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:39:11,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:11,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:11,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1233001572, now seen corresponding path program 1 times [2024-10-12 20:39:11,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:11,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369150219] [2024-10-12 20:39:11,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:11,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:39:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:39:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 20:39:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 20:39:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:39:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 20:39:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 20:39:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 20:39:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 20:39:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 20:39:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 20:39:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 20:39:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 20:39:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 20:39:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:11,999 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-12 20:39:12,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:12,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369150219] [2024-10-12 20:39:12,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369150219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:12,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:39:12,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:39:12,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213391486] [2024-10-12 20:39:12,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:12,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:39:12,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:12,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:39:12,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:39:12,005 INFO L87 Difference]: Start difference. First operand 211 states and 340 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-12 20:39:12,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:12,084 INFO L93 Difference]: Finished difference Result 422 states and 682 transitions. [2024-10-12 20:39:12,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:39:12,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 100 [2024-10-12 20:39:12,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:12,090 INFO L225 Difference]: With dead ends: 422 [2024-10-12 20:39:12,090 INFO L226 Difference]: Without dead ends: 213 [2024-10-12 20:39:12,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:39:12,095 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:12,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 654 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:39:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-12 20:39:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-10-12 20:39:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 130 states have (on average 1.5076923076923077) internal successors, (196), 132 states have internal predecessors, (196), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2024-10-12 20:39:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 342 transitions. [2024-10-12 20:39:12,134 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 342 transitions. Word has length 100 [2024-10-12 20:39:12,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:12,137 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 342 transitions. [2024-10-12 20:39:12,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-12 20:39:12,138 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 342 transitions. [2024-10-12 20:39:12,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 20:39:12,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:12,144 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:39:12,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:39:12,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:12,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:12,145 INFO L85 PathProgramCache]: Analyzing trace with hash -631579465, now seen corresponding path program 1 times [2024-10-12 20:39:12,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:12,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998338459] [2024-10-12 20:39:12,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:12,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:12,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 20:39:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:12,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:39:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:12,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 20:39:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:12,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:39:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:12,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 20:39:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:12,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 20:39:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:12,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 20:39:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:12,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:39:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:12,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 20:39:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:12,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 20:39:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:12,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 20:39:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:12,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 20:39:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:12,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:39:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:12,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-12 20:39:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-10-12 20:39:12,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:12,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998338459] [2024-10-12 20:39:12,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998338459] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:39:12,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084942507] [2024-10-12 20:39:12,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:12,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:39:12,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:39:12,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:39:12,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 20:39:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:12,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 20:39:12,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:39:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-10-12 20:39:12,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:39:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-10-12 20:39:13,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084942507] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:39:13,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:39:13,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-12 20:39:13,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621076528] [2024-10-12 20:39:13,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:39:13,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:39:13,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:13,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:39:13,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:39:13,095 INFO L87 Difference]: Start difference. First operand 213 states and 342 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-12 20:39:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:13,182 INFO L93 Difference]: Finished difference Result 428 states and 690 transitions. [2024-10-12 20:39:13,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:39:13,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 102 [2024-10-12 20:39:13,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:13,188 INFO L225 Difference]: With dead ends: 428 [2024-10-12 20:39:13,190 INFO L226 Difference]: Without dead ends: 217 [2024-10-12 20:39:13,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:39:13,193 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:13,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 654 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:39:13,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-12 20:39:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-10-12 20:39:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 134 states have (on average 1.492537313432836) internal successors, (200), 136 states have internal predecessors, (200), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2024-10-12 20:39:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 346 transitions. [2024-10-12 20:39:13,218 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 346 transitions. Word has length 102 [2024-10-12 20:39:13,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:13,219 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 346 transitions. [2024-10-12 20:39:13,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-12 20:39:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 346 transitions. [2024-10-12 20:39:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 20:39:13,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:13,221 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:39:13,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 20:39:13,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:39:13,423 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:13,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:13,423 INFO L85 PathProgramCache]: Analyzing trace with hash 903316247, now seen corresponding path program 2 times [2024-10-12 20:39:13,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:13,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225933521] [2024-10-12 20:39:13,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:13,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:39:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 20:39:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 20:39:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:39:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 20:39:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 20:39:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 20:39:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 20:39:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 20:39:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 20:39:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 20:39:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 20:39:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 20:39:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:39:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-10-12 20:39:13,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:13,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225933521] [2024-10-12 20:39:13,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225933521] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:39:13,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741402215] [2024-10-12 20:39:13,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 20:39:13,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:39:13,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:39:13,684 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:39:13,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 20:39:14,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 20:39:14,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 20:39:14,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 20:39:14,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:39:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-10-12 20:39:14,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:39:14,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741402215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:14,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:39:14,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 20:39:14,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907021270] [2024-10-12 20:39:14,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:14,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:39:14,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:14,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:39:14,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:39:14,293 INFO L87 Difference]: Start difference. First operand 217 states and 346 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-12 20:39:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:14,401 INFO L93 Difference]: Finished difference Result 418 states and 680 transitions. [2024-10-12 20:39:14,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:39:14,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 106 [2024-10-12 20:39:14,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:14,407 INFO L225 Difference]: With dead ends: 418 [2024-10-12 20:39:14,407 INFO L226 Difference]: Without dead ends: 384 [2024-10-12 20:39:14,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:39:14,408 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 273 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1019 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-12 20:39:14,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1019 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:39:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-12 20:39:14,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-10-12 20:39:14,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 234 states have (on average 1.5384615384615385) internal successors, (360), 238 states have internal predecessors, (360), 131 states have call successors, (131), 18 states have call predecessors, (131), 18 states have return successors, (139), 131 states have call predecessors, (139), 131 states have call successors, (139) [2024-10-12 20:39:14,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 630 transitions. [2024-10-12 20:39:14,448 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 630 transitions. Word has length 106 [2024-10-12 20:39:14,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:14,448 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 630 transitions. [2024-10-12 20:39:14,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-12 20:39:14,449 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 630 transitions. [2024-10-12 20:39:14,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-12 20:39:14,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:14,455 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:39:14,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 20:39:14,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-12 20:39:14,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:14,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:14,659 INFO L85 PathProgramCache]: Analyzing trace with hash -2137871054, now seen corresponding path program 1 times [2024-10-12 20:39:14,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:14,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913482456] [2024-10-12 20:39:14,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:14,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:39:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:39:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:39:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:39:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 20:39:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:39:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 20:39:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 20:39:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 20:39:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 20:39:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 20:39:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 20:39:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 20:39:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 20:39:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-12 20:39:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-12 20:39:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:39:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-12 20:39:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-12 20:39:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-12 20:39:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-12 20:39:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 20:39:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-12 20:39:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2024-10-12 20:39:15,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:15,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913482456] [2024-10-12 20:39:15,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913482456] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:39:15,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016778874] [2024-10-12 20:39:15,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:15,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:39:15,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:39:15,387 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:39:15,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 20:39:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:15,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 20:39:15,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:39:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2024-10-12 20:39:15,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:39:16,251 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2024-10-12 20:39:16,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016778874] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:39:16,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:39:16,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 13 [2024-10-12 20:39:16,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784103244] [2024-10-12 20:39:16,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:39:16,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:39:16,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:16,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:39:16,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:39:16,254 INFO L87 Difference]: Start difference. First operand 384 states and 630 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (57), 6 states have call predecessors, (57), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-10-12 20:39:20,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:24,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:25,872 INFO L93 Difference]: Finished difference Result 797 states and 1306 transitions. [2024-10-12 20:39:25,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 20:39:25,872 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (57), 6 states have call predecessors, (57), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 182 [2024-10-12 20:39:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:25,877 INFO L225 Difference]: With dead ends: 797 [2024-10-12 20:39:25,877 INFO L226 Difference]: Without dead ends: 415 [2024-10-12 20:39:25,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 417 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2024-10-12 20:39:25,881 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 221 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 316 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:25,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1264 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1060 Invalid, 1 Unknown, 0 Unchecked, 9.3s Time] [2024-10-12 20:39:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-12 20:39:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 403. [2024-10-12 20:39:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 251 states have (on average 1.5099601593625498) internal successors, (379), 257 states have internal predecessors, (379), 131 states have call successors, (131), 18 states have call predecessors, (131), 20 states have return successors, (143), 131 states have call predecessors, (143), 131 states have call successors, (143) [2024-10-12 20:39:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 653 transitions. [2024-10-12 20:39:25,932 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 653 transitions. Word has length 182 [2024-10-12 20:39:25,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:25,933 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 653 transitions. [2024-10-12 20:39:25,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (57), 6 states have call predecessors, (57), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-10-12 20:39:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 653 transitions. [2024-10-12 20:39:25,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-12 20:39:25,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:25,938 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:39:25,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 20:39:26,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:39:26,143 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:26,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:26,144 INFO L85 PathProgramCache]: Analyzing trace with hash 980289067, now seen corresponding path program 1 times [2024-10-12 20:39:26,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:26,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070539743] [2024-10-12 20:39:26,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:26,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:26,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:39:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 20:39:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:39:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 20:39:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 20:39:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 20:39:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 20:39:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 20:39:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 20:39:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 20:39:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 20:39:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-12 20:39:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-12 20:39:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:39:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-12 20:39:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-12 20:39:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-12 20:39:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-12 20:39:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 20:39:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-12 20:39:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 20:39:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-12 20:39:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:27,230 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2024-10-12 20:39:27,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:27,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070539743] [2024-10-12 20:39:27,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070539743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:27,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:39:27,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:39:27,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203008948] [2024-10-12 20:39:27,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:27,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:39:27,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:27,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:39:27,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:39:27,233 INFO L87 Difference]: Start difference. First operand 403 states and 653 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-10-12 20:39:31,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:35,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:37,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:37,795 INFO L93 Difference]: Finished difference Result 833 states and 1363 transitions. [2024-10-12 20:39:37,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:39:37,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 194 [2024-10-12 20:39:37,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:37,802 INFO L225 Difference]: With dead ends: 833 [2024-10-12 20:39:37,803 INFO L226 Difference]: Without dead ends: 795 [2024-10-12 20:39:37,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:39:37,804 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 427 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 184 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:37,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1100 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 937 Invalid, 2 Unknown, 0 Unchecked, 10.0s Time] [2024-10-12 20:39:37,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2024-10-12 20:39:37,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 777. [2024-10-12 20:39:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 472 states have (on average 1.5296610169491525) internal successors, (722), 487 states have internal predecessors, (722), 261 states have call successors, (261), 36 states have call predecessors, (261), 43 states have return successors, (301), 261 states have call predecessors, (301), 261 states have call successors, (301) [2024-10-12 20:39:37,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1284 transitions. [2024-10-12 20:39:37,916 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1284 transitions. Word has length 194 [2024-10-12 20:39:37,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:37,919 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 1284 transitions. [2024-10-12 20:39:37,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-10-12 20:39:37,919 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1284 transitions. [2024-10-12 20:39:37,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-12 20:39:37,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:37,929 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:39:37,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:39:37,929 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:37,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:37,930 INFO L85 PathProgramCache]: Analyzing trace with hash 35447701, now seen corresponding path program 1 times [2024-10-12 20:39:37,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:37,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879412301] [2024-10-12 20:39:37,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:37,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 20:39:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 20:39:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:39:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 20:39:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 20:39:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 20:39:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 20:39:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 20:39:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 20:39:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 20:39:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 20:39:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-12 20:39:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-12 20:39:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:39:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-12 20:39:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-12 20:39:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-12 20:39:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-12 20:39:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 20:39:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-12 20:39:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 20:39:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-12 20:39:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2024-10-12 20:39:38,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:38,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879412301] [2024-10-12 20:39:38,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879412301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:38,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:39:38,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:39:38,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146126343] [2024-10-12 20:39:38,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:38,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:39:38,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:38,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:39:38,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:39:38,850 INFO L87 Difference]: Start difference. First operand 777 states and 1284 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-10-12 20:39:43,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:47,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:49,670 INFO L93 Difference]: Finished difference Result 1521 states and 2508 transitions. [2024-10-12 20:39:49,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:39:49,671 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 194 [2024-10-12 20:39:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:49,677 INFO L225 Difference]: With dead ends: 1521 [2024-10-12 20:39:49,678 INFO L226 Difference]: Without dead ends: 776 [2024-10-12 20:39:49,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:39:49,682 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 421 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 184 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:49,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1209 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1136 Invalid, 2 Unknown, 0 Unchecked, 10.3s Time] [2024-10-12 20:39:49,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-10-12 20:39:49,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 760. [2024-10-12 20:39:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 463 states have (on average 1.5226781857451404) internal successors, (705), 478 states have internal predecessors, (705), 253 states have call successors, (253), 35 states have call predecessors, (253), 43 states have return successors, (286), 254 states have call predecessors, (286), 253 states have call successors, (286) [2024-10-12 20:39:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1244 transitions. [2024-10-12 20:39:49,766 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1244 transitions. Word has length 194 [2024-10-12 20:39:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:49,767 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1244 transitions. [2024-10-12 20:39:49,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-10-12 20:39:49,767 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1244 transitions. [2024-10-12 20:39:49,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-12 20:39:49,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:49,774 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:39:49,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:39:49,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:49,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:49,775 INFO L85 PathProgramCache]: Analyzing trace with hash -188967617, now seen corresponding path program 1 times [2024-10-12 20:39:49,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:49,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508040923] [2024-10-12 20:39:49,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:49,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 20:39:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 20:39:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:39:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 20:39:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 20:39:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 20:39:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 20:39:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 20:39:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 20:39:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 20:39:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 20:39:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-12 20:39:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-12 20:39:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:39:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-12 20:39:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-12 20:39:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-12 20:39:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-12 20:39:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 20:39:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-12 20:39:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 20:39:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-12 20:39:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2024-10-12 20:39:50,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:50,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508040923] [2024-10-12 20:39:50,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508040923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:50,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:39:50,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:39:50,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729159389] [2024-10-12 20:39:50,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:50,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:39:50,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:50,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:39:50,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:39:50,890 INFO L87 Difference]: Start difference. First operand 760 states and 1244 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-10-12 20:39:55,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:59,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:04,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:06,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:40:06,013 INFO L93 Difference]: Finished difference Result 1209 states and 1949 transitions. [2024-10-12 20:40:06,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:40:06,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 194 [2024-10-12 20:40:06,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:40:06,019 INFO L225 Difference]: With dead ends: 1209 [2024-10-12 20:40:06,020 INFO L226 Difference]: Without dead ends: 690 [2024-10-12 20:40:06,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:40:06,023 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 424 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 168 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:40:06,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1157 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 924 Invalid, 3 Unknown, 0 Unchecked, 14.6s Time] [2024-10-12 20:40:06,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-10-12 20:40:06,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 670. [2024-10-12 20:40:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 412 states have (on average 1.4902912621359223) internal successors, (614), 425 states have internal predecessors, (614), 214 states have call successors, (214), 35 states have call predecessors, (214), 43 states have return successors, (244), 215 states have call predecessors, (244), 214 states have call successors, (244) [2024-10-12 20:40:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1072 transitions. [2024-10-12 20:40:06,091 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1072 transitions. Word has length 194 [2024-10-12 20:40:06,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:40:06,092 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 1072 transitions. [2024-10-12 20:40:06,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-10-12 20:40:06,092 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1072 transitions. [2024-10-12 20:40:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-12 20:40:06,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:40:06,100 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:40:06,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:40:06,100 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:40:06,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:40:06,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1909593472, now seen corresponding path program 1 times [2024-10-12 20:40:06,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:40:06,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728295776] [2024-10-12 20:40:06,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:40:06,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:40:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 20:40:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:40:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:40:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:40:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 20:40:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:40:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 20:40:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 20:40:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 20:40:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 20:40:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:40:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-12 20:40:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-12 20:40:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-12 20:40:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-12 20:40:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-12 20:40:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-12 20:40:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-12 20:40:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-12 20:40:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-12 20:40:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-12 20:40:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-12 20:40:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-12 20:40:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,182 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 824 trivial. 0 not checked. [2024-10-12 20:40:07,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:40:07,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728295776] [2024-10-12 20:40:07,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728295776] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:40:07,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285246923] [2024-10-12 20:40:07,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:40:07,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:40:07,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:40:07,185 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:40:07,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 20:40:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:07,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 20:40:07,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:40:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 280 proven. 4 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2024-10-12 20:40:08,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:40:08,424 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2024-10-12 20:40:08,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285246923] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:40:08,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:40:08,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 16 [2024-10-12 20:40:08,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207489277] [2024-10-12 20:40:08,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:40:08,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 20:40:08,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:40:08,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 20:40:08,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:40:08,427 INFO L87 Difference]: Start difference. First operand 670 states and 1072 transitions. Second operand has 16 states, 16 states have (on average 5.5625) internal successors, (89), 12 states have internal predecessors, (89), 9 states have call successors, (51), 8 states have call predecessors, (51), 7 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2024-10-12 20:40:12,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:13,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:40:18,533 INFO L93 Difference]: Finished difference Result 1694 states and 2736 transitions. [2024-10-12 20:40:18,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 20:40:18,533 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 12 states have internal predecessors, (89), 9 states have call successors, (51), 8 states have call predecessors, (51), 7 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) Word has length 197 [2024-10-12 20:40:18,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:40:18,542 INFO L225 Difference]: With dead ends: 1694 [2024-10-12 20:40:18,542 INFO L226 Difference]: Without dead ends: 1055 [2024-10-12 20:40:18,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2024-10-12 20:40:18,547 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 1141 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 1128 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1128 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:40:18,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 1456 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1128 Valid, 1776 Invalid, 1 Unknown, 0 Unchecked, 9.2s Time] [2024-10-12 20:40:18,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2024-10-12 20:40:18,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1022. [2024-10-12 20:40:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 620 states have (on average 1.4935483870967743) internal successors, (926), 640 states have internal predecessors, (926), 335 states have call successors, (335), 57 states have call predecessors, (335), 66 states have return successors, (382), 334 states have call predecessors, (382), 335 states have call successors, (382) [2024-10-12 20:40:18,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1643 transitions. [2024-10-12 20:40:18,660 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1643 transitions. Word has length 197 [2024-10-12 20:40:18,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:40:18,661 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1643 transitions. [2024-10-12 20:40:18,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 12 states have internal predecessors, (89), 9 states have call successors, (51), 8 states have call predecessors, (51), 7 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2024-10-12 20:40:18,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1643 transitions. [2024-10-12 20:40:18,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-12 20:40:18,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:40:18,671 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:40:18,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 20:40:18,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:40:18,874 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:40:18,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:40:18,874 INFO L85 PathProgramCache]: Analyzing trace with hash -722934082, now seen corresponding path program 1 times [2024-10-12 20:40:18,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:40:18,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120081807] [2024-10-12 20:40:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:40:18,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:40:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:20,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 20:40:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:40:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:40:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:40:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 20:40:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:40:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 20:40:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 20:40:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 20:40:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 20:40:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:40:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-12 20:40:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-12 20:40:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-12 20:40:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-12 20:40:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-12 20:40:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-12 20:40:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-12 20:40:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-12 20:40:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-12 20:40:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-12 20:40:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-12 20:40:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-12 20:40:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 824 trivial. 0 not checked. [2024-10-12 20:40:21,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:40:21,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120081807] [2024-10-12 20:40:21,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120081807] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:40:21,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670919429] [2024-10-12 20:40:21,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:40:21,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:40:21,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:40:21,820 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:40:21,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 20:40:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:22,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 1653 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-12 20:40:22,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:40:22,752 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