./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stateful-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/seq-pthread/cs_stateful-2.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 c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:10:55,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:10:55,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:10:55,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:10:55,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:10:55,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:10:55,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:10:55,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:10:55,680 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:10:55,680 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:10:55,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:10:55,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:10:55,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:10:55,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:10:55,685 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:10:55,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:10:55,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:10:55,687 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:10:55,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:10:55,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:10:55,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:10:55,690 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:10:55,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:10:55,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:10:55,691 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:10:55,692 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:10:55,692 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:10:55,692 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:10:55,693 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:10:55,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:10:55,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:10:55,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:10:55,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:10:55,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:10:55,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:10:55,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:10:55,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:10:55,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:10:55,698 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:10:55,698 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:10:55,698 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:10:55,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:10:55,699 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 -> c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc [2024-11-10 00:10:55,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:10:55,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:10:55,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:10:55,998 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:10:55,999 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:10:56,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2024-11-10 00:10:57,574 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:10:57,872 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:10:57,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2024-11-10 00:10:57,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84b05e62/8bc335c386bd43a8a054d28e1cc595bb/FLAG66426801f [2024-11-10 00:10:58,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84b05e62/8bc335c386bd43a8a054d28e1cc595bb [2024-11-10 00:10:58,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:10:58,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:10:58,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:10:58,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:10:58,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:10:58,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:10:58" (1/1) ... [2024-11-10 00:10:58,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe443f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:58, skipping insertion in model container [2024-11-10 00:10:58,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:10:58" (1/1) ... [2024-11-10 00:10:58,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:10:58,594 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i[23607,23620] [2024-11-10 00:10:58,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:10:58,732 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:10:58,776 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i[23607,23620] [2024-11-10 00:10:58,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:10:58,872 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:10:58,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:58 WrapperNode [2024-11-10 00:10:58,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:10:58,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:10:58,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:10:58,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:10:58,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:58" (1/1) ... [2024-11-10 00:10:58,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:58" (1/1) ... [2024-11-10 00:10:58,989 INFO L138 Inliner]: procedures = 145, calls = 254, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 552 [2024-11-10 00:10:58,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:10:58,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:10:58,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:10:58,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:10:59,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:58" (1/1) ... [2024-11-10 00:10:59,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:58" (1/1) ... [2024-11-10 00:10:59,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:58" (1/1) ... [2024-11-10 00:10:59,080 INFO L175 MemorySlicer]: Split 122 memory accesses to 17 slices as follows [2, 7, 8, 8, 3, 8, 20, 12, 6, 10, 10, 12, 3, 3, 7, 3, 0]. 16 percent of accesses are in the largest equivalence class. The 33 initializations are split as follows [2, 0, 3, 3, 0, 3, 6, 6, 2, 2, 2, 4, 0, 0, 0, 0, 0]. The 37 writes are split as follows [0, 1, 2, 2, 1, 2, 8, 3, 2, 4, 4, 4, 1, 1, 1, 1, 0]. [2024-11-10 00:10:59,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:58" (1/1) ... [2024-11-10 00:10:59,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:58" (1/1) ... [2024-11-10 00:10:59,119 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:58" (1/1) ... [2024-11-10 00:10:59,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:58" (1/1) ... [2024-11-10 00:10:59,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:58" (1/1) ... [2024-11-10 00:10:59,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:58" (1/1) ... [2024-11-10 00:10:59,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:10:59,147 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:10:59,147 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:10:59,147 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:10:59,148 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:58" (1/1) ... [2024-11-10 00:10:59,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:10:59,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:10:59,188 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-11-10 00:10:59,192 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-11-10 00:10:59,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 00:10:59,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 00:10:59,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 00:10:59,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 00:10:59,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 00:10:59,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 00:10:59,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-10 00:10:59,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-10 00:10:59,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-10 00:10:59,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-10 00:10:59,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-10 00:10:59,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-10 00:10:59,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-10 00:10:59,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-10 00:10:59,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-10 00:10:59,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-10 00:10:59,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-11-10 00:10:59,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 00:10:59,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 00:10:59,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 00:10:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 00:10:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 00:10:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 00:10:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-10 00:10:59,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-10 00:10:59,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-10 00:10:59,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-10 00:10:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-10 00:10:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-10 00:10:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-10 00:10:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-10 00:10:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-10 00:10:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-10 00:10:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-11-10 00:10:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 00:10:59,256 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 00:10:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:10:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 00:10:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 00:10:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 00:10:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 00:10:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-10 00:10:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-10 00:10:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-10 00:10:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-10 00:10:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-10 00:10:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-10 00:10:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-10 00:10:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-10 00:10:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-10 00:10:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-10 00:10:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-10 00:10:59,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-11-10 00:10:59,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-11-10 00:10:59,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-11-10 00:10:59,259 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2024-11-10 00:10:59,259 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2024-11-10 00:10:59,259 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2024-11-10 00:10:59,259 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2024-11-10 00:10:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-11-10 00:10:59,260 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-11-10 00:10:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 00:10:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 00:10:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 00:10:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-10 00:10:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-10 00:10:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-10 00:10:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-10 00:10:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-10 00:10:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-10 00:10:59,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-10 00:10:59,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-10 00:10:59,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-10 00:10:59,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-10 00:10:59,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-10 00:10:59,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-11-10 00:10:59,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-11-10 00:10:59,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-11-10 00:10:59,261 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-11-10 00:10:59,261 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-11-10 00:10:59,261 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-10 00:10:59,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-10 00:10:59,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 00:10:59,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 00:10:59,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 00:10:59,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-10 00:10:59,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-10 00:10:59,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-10 00:10:59,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-10 00:10:59,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-10 00:10:59,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-10 00:10:59,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-10 00:10:59,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-10 00:10:59,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-10 00:10:59,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-11-10 00:10:59,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-11-10 00:10:59,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-11-10 00:10:59,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-11-10 00:10:59,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-11-10 00:10:59,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-11-10 00:10:59,265 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-11-10 00:10:59,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-11-10 00:10:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:10:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 00:10:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 00:10:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 00:10:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 00:10:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 00:10:59,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-10 00:10:59,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-10 00:10:59,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-10 00:10:59,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-10 00:10:59,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-10 00:10:59,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-10 00:10:59,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-10 00:10:59,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-10 00:10:59,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-10 00:10:59,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-10 00:10:59,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-10 00:10:59,268 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2024-11-10 00:10:59,269 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2024-11-10 00:10:59,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:10:59,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:10:59,533 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:10:59,536 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:10:59,990 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2024-11-10 00:10:59,991 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-10 00:10:59,991 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: SUMMARY for call __CS_cs(); srcloc: null [2024-11-10 00:10:59,991 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2024-11-10 00:10:59,991 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-10 00:10:59,991 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-2: SUMMARY for call __CS_cs(); srcloc: null [2024-11-10 00:10:59,992 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2024-11-10 00:10:59,992 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-10 00:10:59,992 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-2: SUMMARY for call __CS_cs(); srcloc: null [2024-11-10 00:11:00,455 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-10 00:11:00,455 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:11:00,478 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:11:00,479 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:11:00,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:11:00 BoogieIcfgContainer [2024-11-10 00:11:00,480 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:11:00,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:11:00,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:11:00,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:11:00,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:10:58" (1/3) ... [2024-11-10 00:11:00,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5206cbb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:11:00, skipping insertion in model container [2024-11-10 00:11:00,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:58" (2/3) ... [2024-11-10 00:11:00,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5206cbb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:11:00, skipping insertion in model container [2024-11-10 00:11:00,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:11:00" (3/3) ... [2024-11-10 00:11:00,491 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_stateful-2.i [2024-11-10 00:11:00,508 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:11:00,509 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 00:11:00,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:11:00,606 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;@6de13dde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:11:00,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 00:11:00,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 111 states have (on average 1.4414414414414414) internal successors, (160), 112 states have internal predecessors, (160), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 00:11:00,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 00:11:00,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:00,633 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:11:00,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:00,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:00,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1117349226, now seen corresponding path program 1 times [2024-11-10 00:11:00,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:00,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517024570] [2024-11-10 00:11:00,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:00,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 00:11:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 00:11:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 00:11:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 00:11:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 00:11:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 00:11:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 00:11:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 00:11:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 00:11:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 00:11:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 00:11:01,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:01,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517024570] [2024-11-10 00:11:01,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517024570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:11:01,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:11:01,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:11:01,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280074810] [2024-11-10 00:11:01,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:11:01,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:11:01,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:01,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:11:01,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:11:01,250 INFO L87 Difference]: Start difference. First operand has 175 states, 111 states have (on average 1.4414414414414414) internal successors, (160), 112 states have internal predecessors, (160), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 00:11:01,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:01,303 INFO L93 Difference]: Finished difference Result 347 states and 575 transitions. [2024-11-10 00:11:01,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:11:01,305 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2024-11-10 00:11:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:01,314 INFO L225 Difference]: With dead ends: 347 [2024-11-10 00:11:01,315 INFO L226 Difference]: Without dead ends: 170 [2024-11-10 00:11:01,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:11:01,328 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:01,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:11:01,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-10 00:11:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-11-10 00:11:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 107 states have (on average 1.411214953271028) internal successors, (151), 107 states have internal predecessors, (151), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 00:11:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 259 transitions. [2024-11-10 00:11:01,384 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 259 transitions. Word has length 73 [2024-11-10 00:11:01,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:01,385 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 259 transitions. [2024-11-10 00:11:01,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 00:11:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 259 transitions. [2024-11-10 00:11:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 00:11:01,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:01,391 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:11:01,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:11:01,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:01,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:01,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1546290145, now seen corresponding path program 1 times [2024-11-10 00:11:01,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:01,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936402254] [2024-11-10 00:11:01,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:01,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 00:11:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 00:11:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 00:11:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 00:11:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 00:11:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 00:11:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 00:11:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-10 00:11:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 00:11:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 00:11:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 00:11:01,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:01,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936402254] [2024-11-10 00:11:01,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936402254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:11:01,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:11:01,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:11:01,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397723594] [2024-11-10 00:11:01,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:11:01,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:11:01,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:01,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:11:01,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:11:01,761 INFO L87 Difference]: Start difference. First operand 170 states and 259 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 00:11:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:01,840 INFO L93 Difference]: Finished difference Result 338 states and 516 transitions. [2024-11-10 00:11:01,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:11:01,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 74 [2024-11-10 00:11:01,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:01,848 INFO L225 Difference]: With dead ends: 338 [2024-11-10 00:11:01,848 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 00:11:01,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:11:01,851 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 4 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:01,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 510 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:11:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 00:11:01,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2024-11-10 00:11:01,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 109 states have internal predecessors, (153), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 00:11:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 261 transitions. [2024-11-10 00:11:01,878 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 261 transitions. Word has length 74 [2024-11-10 00:11:01,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:01,879 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 261 transitions. [2024-11-10 00:11:01,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 00:11:01,880 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 261 transitions. [2024-11-10 00:11:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:11:01,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:01,883 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2024-11-10 00:11:01,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:11:01,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:01,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:01,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1776870283, now seen corresponding path program 1 times [2024-11-10 00:11:01,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:01,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022220117] [2024-11-10 00:11:01,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:01,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 00:11:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 00:11:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 00:11:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 00:11:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 00:11:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 00:11:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 00:11:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 00:11:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 00:11:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 00:11:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 00:11:02,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:02,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022220117] [2024-11-10 00:11:02,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022220117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:11:02,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:11:02,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:11:02,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078999543] [2024-11-10 00:11:02,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:11:02,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:11:02,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:02,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:11:02,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:11:02,137 INFO L87 Difference]: Start difference. First operand 172 states and 261 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 00:11:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:02,168 INFO L93 Difference]: Finished difference Result 342 states and 521 transitions. [2024-11-10 00:11:02,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:11:02,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 79 [2024-11-10 00:11:02,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:02,173 INFO L225 Difference]: With dead ends: 342 [2024-11-10 00:11:02,173 INFO L226 Difference]: Without dead ends: 174 [2024-11-10 00:11:02,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:11:02,180 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:02,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 513 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:11:02,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-10 00:11:02,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-10 00:11:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 111 states have (on average 1.3963963963963963) internal successors, (155), 111 states have internal predecessors, (155), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 00:11:02,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 263 transitions. [2024-11-10 00:11:02,201 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 263 transitions. Word has length 79 [2024-11-10 00:11:02,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:02,201 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 263 transitions. [2024-11-10 00:11:02,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 00:11:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 263 transitions. [2024-11-10 00:11:02,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:11:02,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:02,205 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2024-11-10 00:11:02,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:11:02,206 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:02,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:02,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1364489206, now seen corresponding path program 1 times [2024-11-10 00:11:02,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:02,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396920435] [2024-11-10 00:11:02,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:02,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 00:11:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 00:11:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 00:11:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 00:11:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 00:11:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 00:11:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 00:11:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 00:11:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 00:11:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 00:11:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 00:11:02,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:02,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396920435] [2024-11-10 00:11:02,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396920435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:11:02,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585340135] [2024-11-10 00:11:02,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:02,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:11:02,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:11:02,514 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-11-10 00:11:02,515 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-11-10 00:11:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:02,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 00:11:02,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:11:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 00:11:02,965 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:11:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 00:11:03,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585340135] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:11:03,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:11:03,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-10 00:11:03,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074453333] [2024-11-10 00:11:03,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:11:03,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:11:03,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:03,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:11:03,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:11:03,065 INFO L87 Difference]: Start difference. First operand 174 states and 263 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 00:11:03,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:03,122 INFO L93 Difference]: Finished difference Result 348 states and 528 transitions. [2024-11-10 00:11:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:11:03,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 81 [2024-11-10 00:11:03,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:03,127 INFO L225 Difference]: With dead ends: 348 [2024-11-10 00:11:03,128 INFO L226 Difference]: Without dead ends: 178 [2024-11-10 00:11:03,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 179 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-11-10 00:11:03,130 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 0 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:03,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1278 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:11:03,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-10 00:11:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-10 00:11:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 115 states have (on average 1.382608695652174) internal successors, (159), 115 states have internal predecessors, (159), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 00:11:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 267 transitions. [2024-11-10 00:11:03,159 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 267 transitions. Word has length 81 [2024-11-10 00:11:03,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:03,159 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 267 transitions. [2024-11-10 00:11:03,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 00:11:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 267 transitions. [2024-11-10 00:11:03,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 00:11:03,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:03,166 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:11:03,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 00:11:03,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:11:03,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:03,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:03,368 INFO L85 PathProgramCache]: Analyzing trace with hash -663904712, now seen corresponding path program 2 times [2024-11-10 00:11:03,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:03,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577604451] [2024-11-10 00:11:03,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:03,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:03,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 00:11:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 00:11:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:03,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 00:11:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:03,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 00:11:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:03,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 00:11:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:03,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 00:11:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:03,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 00:11:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:03,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 00:11:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:03,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 00:11:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:03,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 00:11:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-10 00:11:03,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:03,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577604451] [2024-11-10 00:11:03,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577604451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:11:03,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256527101] [2024-11-10 00:11:03,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 00:11:03,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:11:03,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:11:03,746 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-11-10 00:11:03,747 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-11-10 00:11:04,083 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 00:11:04,084 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 00:11:04,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 00:11:04,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:11:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-10 00:11:04,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 00:11:04,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256527101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:11:04,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 00:11:04,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-10 00:11:04,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903279369] [2024-11-10 00:11:04,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:11:04,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:11:04,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:04,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:11:04,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:11:04,244 INFO L87 Difference]: Start difference. First operand 178 states and 267 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 00:11:04,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:04,294 INFO L93 Difference]: Finished difference Result 338 states and 521 transitions. [2024-11-10 00:11:04,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:11:04,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 85 [2024-11-10 00:11:04,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:04,300 INFO L225 Difference]: With dead ends: 338 [2024-11-10 00:11:04,300 INFO L226 Difference]: Without dead ends: 311 [2024-11-10 00:11:04,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 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-11-10 00:11:04,301 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 204 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:04,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 917 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:11:04,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-10 00:11:04,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 310. [2024-11-10 00:11:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 196 states have (on average 1.4234693877551021) internal successors, (279), 196 states have internal predecessors, (279), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (105), 97 states have call predecessors, (105), 97 states have call successors, (105) [2024-11-10 00:11:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 481 transitions. [2024-11-10 00:11:04,334 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 481 transitions. Word has length 85 [2024-11-10 00:11:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:04,334 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 481 transitions. [2024-11-10 00:11:04,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 00:11:04,335 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 481 transitions. [2024-11-10 00:11:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 00:11:04,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:04,339 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:11:04,360 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-11-10 00:11:04,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:11:04,541 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:04,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash -656512587, now seen corresponding path program 1 times [2024-11-10 00:11:04,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:04,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513721213] [2024-11-10 00:11:04,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:04,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:04,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 00:11:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:04,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 00:11:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:04,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:04,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 00:11:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:04,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 00:11:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:04,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:04,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-10 00:11:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:05,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:05,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 00:11:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:05,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 00:11:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:05,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:05,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 00:11:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:05,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 00:11:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:05,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 00:11:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:05,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 00:11:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:05,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 00:11:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:05,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 00:11:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:05,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 00:11:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:05,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 00:11:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:05,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 00:11:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:05,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 00:11:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:05,064 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2024-11-10 00:11:05,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:05,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513721213] [2024-11-10 00:11:05,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513721213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:11:05,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296699425] [2024-11-10 00:11:05,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:05,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:11:05,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:11:05,067 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-11-10 00:11:05,069 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-11-10 00:11:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:05,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 00:11:05,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:11:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2024-11-10 00:11:05,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:11:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2024-11-10 00:11:05,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296699425] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:11:05,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:11:05,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2024-11-10 00:11:05,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667056255] [2024-11-10 00:11:05,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:11:05,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:11:05,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:05,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:11:05,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:11:05,762 INFO L87 Difference]: Start difference. First operand 310 states and 481 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 00:11:07,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 00:11:12,021 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-11-10 00:11:12,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:12,723 INFO L93 Difference]: Finished difference Result 626 states and 979 transitions. [2024-11-10 00:11:12,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:11:12,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 151 [2024-11-10 00:11:12,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:12,728 INFO L225 Difference]: With dead ends: 626 [2024-11-10 00:11:12,728 INFO L226 Difference]: Without dead ends: 331 [2024-11-10 00:11:12,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 337 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:11:12,733 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 79 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 162 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:12,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 676 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 431 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2024-11-10 00:11:12,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-10 00:11:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 325. [2024-11-10 00:11:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 209 states have (on average 1.4019138755980862) internal successors, (293), 211 states have internal predecessors, (293), 97 states have call successors, (97), 16 states have call predecessors, (97), 18 states have return successors, (111), 97 states have call predecessors, (111), 97 states have call successors, (111) [2024-11-10 00:11:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 501 transitions. [2024-11-10 00:11:12,778 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 501 transitions. Word has length 151 [2024-11-10 00:11:12,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:12,778 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 501 transitions. [2024-11-10 00:11:12,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 00:11:12,779 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 501 transitions. [2024-11-10 00:11:12,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 00:11:12,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:12,783 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 8, 6, 4, 4, 4, 4, 4, 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] [2024-11-10 00:11:12,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 00:11:12,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:11:12,984 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:12,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:12,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1822564096, now seen corresponding path program 1 times [2024-11-10 00:11:12,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:12,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772307902] [2024-11-10 00:11:12,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:12,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 00:11:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 00:11:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 00:11:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 00:11:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-10 00:11:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 00:11:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 00:11:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 00:11:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 00:11:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 00:11:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 00:11:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 00:11:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 00:11:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 00:11:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 00:11:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 00:11:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 00:11:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2024-11-10 00:11:13,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:13,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772307902] [2024-11-10 00:11:13,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772307902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:11:13,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:11:13,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:11:13,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138474379] [2024-11-10 00:11:13,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:11:13,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:11:13,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:13,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:11:13,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:11:13,959 INFO L87 Difference]: Start difference. First operand 325 states and 501 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 00:11:15,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 00:11:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:16,611 INFO L93 Difference]: Finished difference Result 907 states and 1433 transitions. [2024-11-10 00:11:16,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 00:11:16,613 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 162 [2024-11-10 00:11:16,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:16,643 INFO L225 Difference]: With dead ends: 907 [2024-11-10 00:11:16,645 INFO L226 Difference]: Without dead ends: 625 [2024-11-10 00:11:16,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:11:16,647 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 352 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:16,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 872 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-10 00:11:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-10 00:11:16,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 608. [2024-11-10 00:11:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 380 states have (on average 1.4210526315789473) internal successors, (540), 384 states have internal predecessors, (540), 191 states have call successors, (191), 32 states have call predecessors, (191), 36 states have return successors, (226), 191 states have call predecessors, (226), 191 states have call successors, (226) [2024-11-10 00:11:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 957 transitions. [2024-11-10 00:11:16,722 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 957 transitions. Word has length 162 [2024-11-10 00:11:16,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:16,722 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 957 transitions. [2024-11-10 00:11:16,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 00:11:16,723 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 957 transitions. [2024-11-10 00:11:16,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 00:11:16,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:16,727 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 8, 6, 4, 4, 4, 4, 4, 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] [2024-11-10 00:11:16,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:11:16,727 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:16,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:16,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1160374620, now seen corresponding path program 1 times [2024-11-10 00:11:16,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:16,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935361150] [2024-11-10 00:11:16,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:16,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 00:11:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 00:11:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 00:11:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 00:11:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-10 00:11:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 00:11:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 00:11:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 00:11:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 00:11:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 00:11:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 00:11:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 00:11:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 00:11:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 00:11:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 00:11:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 00:11:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 00:11:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:17,711 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2024-11-10 00:11:17,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:17,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935361150] [2024-11-10 00:11:17,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935361150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:11:17,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:11:17,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:11:17,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355528128] [2024-11-10 00:11:17,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:11:17,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:11:17,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:17,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:11:17,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:11:17,714 INFO L87 Difference]: Start difference. First operand 608 states and 957 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-10 00:11:21,732 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-11-10 00:11:25,743 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-11-10 00:11:27,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:27,657 INFO L93 Difference]: Finished difference Result 951 states and 1491 transitions. [2024-11-10 00:11:27,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 00:11:27,658 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 162 [2024-11-10 00:11:27,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:27,664 INFO L225 Difference]: With dead ends: 951 [2024-11-10 00:11:27,665 INFO L226 Difference]: Without dead ends: 598 [2024-11-10 00:11:27,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-11-10 00:11:27,668 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 434 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 439 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:27,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 920 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 648 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2024-11-10 00:11:27,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-10 00:11:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 578. [2024-11-10 00:11:27,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 366 states have (on average 1.401639344262295) internal successors, (513), 371 states have internal predecessors, (513), 174 states have call successors, (174), 30 states have call predecessors, (174), 37 states have return successors, (208), 176 states have call predecessors, (208), 174 states have call successors, (208) [2024-11-10 00:11:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 895 transitions. [2024-11-10 00:11:27,734 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 895 transitions. Word has length 162 [2024-11-10 00:11:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:27,735 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 895 transitions. [2024-11-10 00:11:27,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-10 00:11:27,737 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 895 transitions. [2024-11-10 00:11:27,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 00:11:27,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:27,742 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 8, 6, 4, 4, 4, 4, 4, 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] [2024-11-10 00:11:27,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:11:27,742 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:27,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:27,743 INFO L85 PathProgramCache]: Analyzing trace with hash 773908256, now seen corresponding path program 1 times [2024-11-10 00:11:27,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:27,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106993267] [2024-11-10 00:11:27,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:27,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 00:11:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 00:11:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 00:11:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 00:11:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-10 00:11:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 00:11:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 00:11:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 00:11:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 00:11:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 00:11:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 00:11:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 00:11:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 00:11:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 00:11:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 00:11:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 00:11:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 00:11:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2024-11-10 00:11:28,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:28,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106993267] [2024-11-10 00:11:28,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106993267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:11:28,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:11:28,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:11:28,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636690760] [2024-11-10 00:11:28,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:11:28,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:11:28,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:28,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:11:28,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:11:28,650 INFO L87 Difference]: Start difference. First operand 578 states and 895 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 00:11:32,778 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-11-10 00:11:34,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:34,418 INFO L93 Difference]: Finished difference Result 908 states and 1389 transitions. [2024-11-10 00:11:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 00:11:34,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 162 [2024-11-10 00:11:34,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:34,423 INFO L225 Difference]: With dead ends: 908 [2024-11-10 00:11:34,423 INFO L226 Difference]: Without dead ends: 561 [2024-11-10 00:11:34,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:11:34,428 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 280 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 106 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:34,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 929 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 648 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2024-11-10 00:11:34,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-11-10 00:11:34,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 541. [2024-11-10 00:11:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 341 states have (on average 1.3343108504398826) internal successors, (455), 346 states have internal predecessors, (455), 164 states have call successors, (164), 29 states have call predecessors, (164), 35 states have return successors, (193), 165 states have call predecessors, (193), 164 states have call successors, (193) [2024-11-10 00:11:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 812 transitions. [2024-11-10 00:11:34,486 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 812 transitions. Word has length 162 [2024-11-10 00:11:34,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:34,487 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 812 transitions. [2024-11-10 00:11:34,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 00:11:34,487 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 812 transitions. [2024-11-10 00:11:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 00:11:34,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:34,491 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 8, 6, 4, 4, 4, 4, 4, 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] [2024-11-10 00:11:34,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:11:34,491 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:34,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:34,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1441122496, now seen corresponding path program 1 times [2024-11-10 00:11:34,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:34,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846743037] [2024-11-10 00:11:34,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:34,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 00:11:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 00:11:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 00:11:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 00:11:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-10 00:11:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 00:11:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 00:11:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 00:11:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 00:11:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 00:11:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 00:11:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 00:11:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 00:11:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 00:11:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 00:11:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 00:11:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 00:11:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2024-11-10 00:11:35,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:35,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846743037] [2024-11-10 00:11:35,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846743037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:11:35,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:11:35,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:11:35,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109434569] [2024-11-10 00:11:35,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:11:35,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:11:35,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:35,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:11:35,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:11:35,529 INFO L87 Difference]: Start difference. First operand 541 states and 812 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-10 00:11:39,547 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-11-10 00:11:42,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 00:11:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:44,156 INFO L93 Difference]: Finished difference Result 602 states and 896 transitions. [2024-11-10 00:11:44,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 00:11:44,157 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 162 [2024-11-10 00:11:44,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:44,161 INFO L225 Difference]: With dead ends: 602 [2024-11-10 00:11:44,161 INFO L226 Difference]: Without dead ends: 475 [2024-11-10 00:11:44,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-11-10 00:11:44,163 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 408 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 388 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:44,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 996 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 801 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2024-11-10 00:11:44,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-10 00:11:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 456. [2024-11-10 00:11:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 293 states have (on average 1.341296928327645) internal successors, (393), 297 states have internal predecessors, (393), 132 states have call successors, (132), 25 states have call predecessors, (132), 30 states have return successors, (157), 133 states have call predecessors, (157), 132 states have call successors, (157) [2024-11-10 00:11:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 682 transitions. [2024-11-10 00:11:44,213 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 682 transitions. Word has length 162 [2024-11-10 00:11:44,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:44,213 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 682 transitions. [2024-11-10 00:11:44,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-10 00:11:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 682 transitions. [2024-11-10 00:11:44,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-10 00:11:44,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:44,219 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 8, 8, 8, 8, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:11:44,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:11:44,219 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:44,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash 443973894, now seen corresponding path program 1 times [2024-11-10 00:11:44,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:44,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710411099] [2024-11-10 00:11:44,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:44,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:44,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 00:11:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 00:11:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 00:11:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 00:11:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 00:11:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 00:11:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 00:11:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 00:11:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 00:11:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 00:11:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 00:11:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 00:11:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 00:11:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 00:11:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 00:11:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 00:11:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-10 00:11:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 00:11:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 00:11:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 00:11:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 00:11:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 00:11:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-10 00:11:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-10 00:11:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2024-11-10 00:11:45,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:45,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710411099] [2024-11-10 00:11:45,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710411099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:11:45,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225580903] [2024-11-10 00:11:45,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:45,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:11:45,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:11:45,456 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-11-10 00:11:45,457 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-11-10 00:11:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:46,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 1549 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 00:11:46,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:11:46,211 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 320 proven. 4 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2024-11-10 00:11:46,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:11:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2024-11-10 00:11:46,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225580903] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:11:46,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:11:46,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 16 [2024-11-10 00:11:46,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125584160] [2024-11-10 00:11:46,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:11:46,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 00:11:46,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:46,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 00:11:46,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-10 00:11:46,729 INFO L87 Difference]: Start difference. First operand 456 states and 682 transitions. Second operand has 16 states, 16 states have (on average 6.3125) internal successors, (101), 12 states have internal predecessors, (101), 9 states have call successors, (56), 8 states have call predecessors, (56), 7 states have return successors, (51), 7 states have call predecessors, (51), 9 states have call successors, (51) [2024-11-10 00:11:48,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 00:11:51,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:51,475 INFO L93 Difference]: Finished difference Result 1126 states and 1736 transitions. [2024-11-10 00:11:51,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 00:11:51,476 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 12 states have internal predecessors, (101), 9 states have call successors, (56), 8 states have call predecessors, (56), 7 states have return successors, (51), 7 states have call predecessors, (51), 9 states have call successors, (51) Word has length 221 [2024-11-10 00:11:51,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:51,483 INFO L225 Difference]: With dead ends: 1126 [2024-11-10 00:11:51,483 INFO L226 Difference]: Without dead ends: 719 [2024-11-10 00:11:51,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2024-11-10 00:11:51,486 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 691 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:51,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1045 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-10 00:11:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-10 00:11:51,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 689. [2024-11-10 00:11:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 434 states have (on average 1.368663594470046) internal successors, (594), 441 states have internal predecessors, (594), 205 states have call successors, (205), 43 states have call predecessors, (205), 49 states have return successors, (249), 204 states have call predecessors, (249), 205 states have call successors, (249) [2024-11-10 00:11:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1048 transitions. [2024-11-10 00:11:51,566 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1048 transitions. Word has length 221 [2024-11-10 00:11:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:51,567 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1048 transitions. [2024-11-10 00:11:51,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 12 states have internal predecessors, (101), 9 states have call successors, (56), 8 states have call predecessors, (56), 7 states have return successors, (51), 7 states have call predecessors, (51), 9 states have call successors, (51) [2024-11-10 00:11:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1048 transitions. [2024-11-10 00:11:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-10 00:11:51,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:51,575 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 8, 8, 8, 8, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:11:51,600 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-11-10 00:11:51,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:11:51,776 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:51,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:51,776 INFO L85 PathProgramCache]: Analyzing trace with hash 682525894, now seen corresponding path program 1 times [2024-11-10 00:11:51,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:51,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075113702] [2024-11-10 00:11:51,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:51,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 00:11:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:54,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 00:11:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:54,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:54,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 00:11:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:54,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 00:11:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:54,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:54,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 00:11:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 00:11:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:54,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:54,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 00:11:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:54,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:54,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 00:11:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:54,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 00:11:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 00:11:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 00:11:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 00:11:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 00:11:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 00:11:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 00:11:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 00:11:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-10 00:11:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 00:11:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 00:11:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 00:11:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 00:11:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 00:11:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-10 00:11:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-10 00:11:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2024-11-10 00:11:55,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:55,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075113702] [2024-11-10 00:11:55,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075113702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:11:55,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391390186] [2024-11-10 00:11:55,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:55,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:11:55,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:11:55,452 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-11-10 00:11:55,454 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-11-10 00:11:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:56,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 1647 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-10 00:11:56,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:11:56,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 00:12:01,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 00:12:01,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 00:12:01,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2024-11-10 00:12:02,654 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-10 00:12:02,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24