./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 3289d67d 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-3289d67-m [2024-11-16 08:51:17,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 08:51:17,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 08:51:17,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 08:51:17,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 08:51:18,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 08:51:18,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 08:51:18,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 08:51:18,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 08:51:18,010 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 08:51:18,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 08:51:18,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 08:51:18,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 08:51:18,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 08:51:18,012 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 08:51:18,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 08:51:18,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 08:51:18,014 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 08:51:18,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 08:51:18,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 08:51:18,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 08:51:18,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 08:51:18,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 08:51:18,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 08:51:18,016 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 08:51:18,016 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 08:51:18,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 08:51:18,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 08:51:18,017 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 08:51:18,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 08:51:18,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 08:51:18,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 08:51:18,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:51:18,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 08:51:18,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 08:51:18,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 08:51:18,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 08:51:18,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 08:51:18,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 08:51:18,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 08:51:18,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 08:51:18,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 08:51:18,025 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-16 08:51:18,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 08:51:18,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 08:51:18,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 08:51:18,293 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 08:51:18,293 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 08:51:18,295 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-16 08:51:19,739 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 08:51:19,995 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 08:51:19,995 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2024-11-16 08:51:20,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3548d74e0/f8e85922a0f345a78a2cd91ce3a9f438/FLAG3bbec1946 [2024-11-16 08:51:20,037 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3548d74e0/f8e85922a0f345a78a2cd91ce3a9f438 [2024-11-16 08:51:20,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 08:51:20,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 08:51:20,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 08:51:20,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 08:51:20,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 08:51:20,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:51:20" (1/1) ... [2024-11-16 08:51:20,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a7eb313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:51:20, skipping insertion in model container [2024-11-16 08:51:20,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:51:20" (1/1) ... [2024-11-16 08:51:20,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 08:51:20,456 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-16 08:51:20,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:51:20,596 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 08:51:20,675 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-16 08:51:20,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:51:20,787 INFO L204 MainTranslator]: Completed translation [2024-11-16 08:51:20,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:51:20 WrapperNode [2024-11-16 08:51:20,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 08:51:20,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 08:51:20,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 08:51:20,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 08:51:20,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:51:20" (1/1) ... [2024-11-16 08:51:20,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:51:20" (1/1) ... [2024-11-16 08:51:20,865 INFO L138 Inliner]: procedures = 145, calls = 254, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 552 [2024-11-16 08:51:20,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 08:51:20,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 08:51:20,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 08:51:20,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 08:51:20,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:51:20" (1/1) ... [2024-11-16 08:51:20,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:51:20" (1/1) ... [2024-11-16 08:51:20,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:51:20" (1/1) ... [2024-11-16 08:51:20,924 INFO L175 MemorySlicer]: Split 122 memory accesses to 17 slices as follows [2, 8, 8, 8, 20, 12, 3, 6, 10, 10, 7, 3, 3, 7, 0, 3, 12]. 16 percent of accesses are in the largest equivalence class. The 33 initializations are split as follows [2, 3, 3, 3, 6, 6, 0, 2, 2, 2, 0, 0, 0, 0, 0, 0, 4]. The 37 writes are split as follows [0, 2, 2, 2, 8, 3, 1, 2, 4, 4, 1, 1, 1, 1, 0, 1, 4]. [2024-11-16 08:51:20,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:51:20" (1/1) ... [2024-11-16 08:51:20,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:51:20" (1/1) ... [2024-11-16 08:51:20,966 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:51:20" (1/1) ... [2024-11-16 08:51:20,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:51:20" (1/1) ... [2024-11-16 08:51:20,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:51:20" (1/1) ... [2024-11-16 08:51:20,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:51:20" (1/1) ... [2024-11-16 08:51:21,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 08:51:21,013 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 08:51:21,013 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 08:51:21,014 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 08:51:21,014 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:51:20" (1/1) ... [2024-11-16 08:51:21,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:51:21,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:51:21,051 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-16 08:51:21,054 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-16 08:51:21,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 08:51:21,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 08:51:21,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 08:51:21,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-16 08:51:21,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-16 08:51:21,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-16 08:51:21,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-16 08:51:21,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-16 08:51:21,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-16 08:51:21,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-16 08:51:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-16 08:51:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-16 08:51:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-16 08:51:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-16 08:51:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-16 08:51:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-16 08:51:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-11-16 08:51:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 08:51:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 08:51:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 08:51:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-16 08:51:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-16 08:51:21,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-16 08:51:21,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-16 08:51:21,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-16 08:51:21,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-16 08:51:21,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-16 08:51:21,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-16 08:51:21,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-16 08:51:21,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-16 08:51:21,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-16 08:51:21,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-16 08:51:21,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-16 08:51:21,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-11-16 08:51:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 08:51:21,113 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 08:51:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 08:51:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 08:51:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 08:51:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 08:51:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-16 08:51:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-16 08:51:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-16 08:51:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-16 08:51:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-16 08:51:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-16 08:51:21,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-16 08:51:21,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-16 08:51:21,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-16 08:51:21,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-16 08:51:21,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-16 08:51:21,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-16 08:51:21,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-11-16 08:51:21,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-11-16 08:51:21,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-11-16 08:51:21,117 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2024-11-16 08:51:21,117 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2024-11-16 08:51:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2024-11-16 08:51:21,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2024-11-16 08:51:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-11-16 08:51:21,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-11-16 08:51:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 08:51:21,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 08:51:21,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-16 08:51:21,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-16 08:51:21,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-16 08:51:21,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-16 08:51:21,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-16 08:51:21,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-16 08:51:21,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-16 08:51:21,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-16 08:51:21,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-16 08:51:21,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-16 08:51:21,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-16 08:51:21,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-16 08:51:21,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-11-16 08:51:21,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-11-16 08:51:21,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-11-16 08:51:21,123 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-11-16 08:51:21,123 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-11-16 08:51:21,123 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-16 08:51:21,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-16 08:51:21,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 08:51:21,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-16 08:51:21,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-16 08:51:21,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-16 08:51:21,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-16 08:51:21,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-16 08:51:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-16 08:51:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-16 08:51:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-16 08:51:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-16 08:51:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-16 08:51:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-16 08:51:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-11-16 08:51:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-11-16 08:51:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-11-16 08:51:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-11-16 08:51:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-11-16 08:51:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-11-16 08:51:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-11-16 08:51:21,124 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-11-16 08:51:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 08:51:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 08:51:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 08:51:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-16 08:51:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-16 08:51:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-16 08:51:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-16 08:51:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-16 08:51:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-16 08:51:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-16 08:51:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-16 08:51:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-16 08:51:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-16 08:51:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-16 08:51:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-16 08:51:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-16 08:51:21,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-16 08:51:21,126 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2024-11-16 08:51:21,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2024-11-16 08:51:21,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 08:51:21,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 08:51:21,421 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 08:51:21,425 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 08:51:21,904 INFO L1250 $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-16 08:51:21,905 INFO L1250 $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-16 08:51:21,905 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: SUMMARY for call __CS_cs(); srcloc: null [2024-11-16 08:51:21,905 INFO L1250 $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-16 08:51:21,905 INFO L1250 $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-16 08:51:21,905 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-2: SUMMARY for call __CS_cs(); srcloc: null [2024-11-16 08:51:21,905 INFO L1250 $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-16 08:51:21,906 INFO L1250 $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-16 08:51:21,906 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-2: SUMMARY for call __CS_cs(); srcloc: null [2024-11-16 08:51:22,963 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-16 08:51:22,964 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 08:51:22,987 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 08:51:22,988 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 08:51:22,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:51:22 BoogieIcfgContainer [2024-11-16 08:51:22,990 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 08:51:22,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 08:51:22,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 08:51:22,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 08:51:22,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:51:20" (1/3) ... [2024-11-16 08:51:22,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33eae6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:51:22, skipping insertion in model container [2024-11-16 08:51:22,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:51:20" (2/3) ... [2024-11-16 08:51:22,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33eae6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:51:22, skipping insertion in model container [2024-11-16 08:51:23,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:51:22" (3/3) ... [2024-11-16 08:51:23,001 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_stateful-2.i [2024-11-16 08:51:23,020 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 08:51:23,021 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 08:51:23,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 08:51:23,105 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;@78c78d07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 08:51:23,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 08:51:23,111 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-16 08:51:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-16 08:51:23,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:51:23,131 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-16 08:51:23,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:51:23,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:51:23,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1117349226, now seen corresponding path program 1 times [2024-11-16 08:51:23,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:51:23,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128882445] [2024-11-16 08:51:23,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:51:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:51:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:23,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 08:51:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:23,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 08:51:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:23,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 08:51:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:23,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 08:51:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:23,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 08:51:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:23,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:51:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:23,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 08:51:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:23,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 08:51:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:23,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-16 08:51:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:23,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 08:51:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:23,691 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-16 08:51:23,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:51:23,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128882445] [2024-11-16 08:51:23,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128882445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:51:23,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:51:23,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 08:51:23,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200283441] [2024-11-16 08:51:23,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:51:23,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 08:51:23,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:51:23,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 08:51:23,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 08:51:23,733 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-16 08:51:23,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:51:23,786 INFO L93 Difference]: Finished difference Result 347 states and 575 transitions. [2024-11-16 08:51:23,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 08:51:23,788 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-16 08:51:23,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:51:23,799 INFO L225 Difference]: With dead ends: 347 [2024-11-16 08:51:23,799 INFO L226 Difference]: Without dead ends: 170 [2024-11-16 08:51:23,813 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-16 08:51:23,817 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-16 08:51:23,821 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-16 08:51:23,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-16 08:51:23,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-11-16 08:51:23,883 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-16 08:51:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 259 transitions. [2024-11-16 08:51:23,889 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 259 transitions. Word has length 73 [2024-11-16 08:51:23,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:51:23,889 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 259 transitions. [2024-11-16 08:51:23,890 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-16 08:51:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 259 transitions. [2024-11-16 08:51:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-16 08:51:23,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:51:23,904 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-16 08:51:23,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 08:51:23,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:51:23,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:51:23,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1546290145, now seen corresponding path program 1 times [2024-11-16 08:51:23,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:51:23,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798444197] [2024-11-16 08:51:23,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:51:23,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:51:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 08:51:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 08:51:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 08:51:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:51:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 08:51:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 08:51:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-16 08:51:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-16 08:51:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 08:51:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 08:51:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,261 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-16 08:51:24,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:51:24,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798444197] [2024-11-16 08:51:24,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798444197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:51:24,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:51:24,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:51:24,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013589140] [2024-11-16 08:51:24,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:51:24,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:51:24,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:51:24,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:51:24,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:51:24,269 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-16 08:51:24,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:51:24,349 INFO L93 Difference]: Finished difference Result 338 states and 516 transitions. [2024-11-16 08:51:24,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:51:24,350 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-16 08:51:24,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:51:24,352 INFO L225 Difference]: With dead ends: 338 [2024-11-16 08:51:24,352 INFO L226 Difference]: Without dead ends: 175 [2024-11-16 08:51:24,355 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-16 08:51:24,357 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-16 08:51:24,359 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-16 08:51:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-16 08:51:24,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2024-11-16 08:51:24,383 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-16 08:51:24,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 261 transitions. [2024-11-16 08:51:24,385 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 261 transitions. Word has length 74 [2024-11-16 08:51:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:51:24,386 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 261 transitions. [2024-11-16 08:51:24,386 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-16 08:51:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 261 transitions. [2024-11-16 08:51:24,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-16 08:51:24,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:51:24,395 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-16 08:51:24,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 08:51:24,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:51:24,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:51:24,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1776870283, now seen corresponding path program 1 times [2024-11-16 08:51:24,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:51:24,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730932236] [2024-11-16 08:51:24,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:51:24,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:51:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 08:51:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 08:51:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 08:51:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 08:51:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:51:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 08:51:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 08:51:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-16 08:51:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 08:51:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-16 08:51:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:24,697 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-16 08:51:24,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:51:24,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730932236] [2024-11-16 08:51:24,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730932236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:51:24,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:51:24,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:51:24,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704458973] [2024-11-16 08:51:24,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:51:24,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:51:24,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:51:24,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:51:24,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:51:24,702 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-16 08:51:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:51:24,746 INFO L93 Difference]: Finished difference Result 342 states and 521 transitions. [2024-11-16 08:51:24,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:51:24,747 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-16 08:51:24,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:51:24,749 INFO L225 Difference]: With dead ends: 342 [2024-11-16 08:51:24,750 INFO L226 Difference]: Without dead ends: 174 [2024-11-16 08:51:24,755 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-16 08:51:24,756 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-16 08:51:24,758 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-16 08:51:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-16 08:51:24,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-16 08:51:24,781 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-16 08:51:24,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 263 transitions. [2024-11-16 08:51:24,784 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 263 transitions. Word has length 79 [2024-11-16 08:51:24,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:51:24,785 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 263 transitions. [2024-11-16 08:51:24,785 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-16 08:51:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 263 transitions. [2024-11-16 08:51:24,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-16 08:51:24,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:51:24,789 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-16 08:51:24,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 08:51:24,790 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:51:24,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:51:24,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1364489206, now seen corresponding path program 1 times [2024-11-16 08:51:24,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:51:24,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236678864] [2024-11-16 08:51:24,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:51:24,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:51:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:25,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 08:51:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:25,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 08:51:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:25,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 08:51:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:25,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 08:51:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:25,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 08:51:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:25,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 08:51:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:25,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 08:51:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:25,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 08:51:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:25,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 08:51:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:25,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 08:51:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:25,068 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-16 08:51:25,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:51:25,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236678864] [2024-11-16 08:51:25,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236678864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:51:25,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551728552] [2024-11-16 08:51:25,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:51:25,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:51:25,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:51:25,075 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-16 08:51:25,077 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-16 08:51:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:25,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 08:51:25,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:51:25,554 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-16 08:51:25,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 08:51:25,649 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-16 08:51:25,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551728552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 08:51:25,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 08:51:25,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-16 08:51:25,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126349842] [2024-11-16 08:51:25,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 08:51:25,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:51:25,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:51:25,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:51:25,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:51:25,653 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-16 08:51:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:51:25,721 INFO L93 Difference]: Finished difference Result 348 states and 528 transitions. [2024-11-16 08:51:25,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:51:25,722 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-16 08:51:25,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:51:25,724 INFO L225 Difference]: With dead ends: 348 [2024-11-16 08:51:25,724 INFO L226 Difference]: Without dead ends: 178 [2024-11-16 08:51:25,727 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-16 08:51:25,728 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-16 08:51:25,730 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-16 08:51:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-16 08:51:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-16 08:51:25,746 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-16 08:51:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 267 transitions. [2024-11-16 08:51:25,748 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 267 transitions. Word has length 81 [2024-11-16 08:51:25,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:51:25,748 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 267 transitions. [2024-11-16 08:51:25,749 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-16 08:51:25,749 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 267 transitions. [2024-11-16 08:51:25,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-16 08:51:25,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:51:25,751 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-16 08:51:25,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 08:51:25,951 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-16 08:51:25,952 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:51:25,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:51:25,952 INFO L85 PathProgramCache]: Analyzing trace with hash -663904712, now seen corresponding path program 2 times [2024-11-16 08:51:25,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:51:25,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449271259] [2024-11-16 08:51:25,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:51:25,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:51:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:26,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 08:51:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:26,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 08:51:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:26,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 08:51:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:26,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:51:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:26,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 08:51:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:26,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 08:51:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:26,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-16 08:51:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:26,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 08:51:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:26,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-16 08:51:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:26,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 08:51:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:26,262 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-16 08:51:26,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:51:26,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449271259] [2024-11-16 08:51:26,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449271259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:51:26,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270843674] [2024-11-16 08:51:26,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 08:51:26,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:51:26,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:51:26,268 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-16 08:51:26,270 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-16 08:51:26,581 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 08:51:26,581 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 08:51:26,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 08:51:26,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:51:26,762 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-16 08:51:26,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:51:26,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270843674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:51:26,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:51:26,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-16 08:51:26,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767507794] [2024-11-16 08:51:26,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:51:26,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:51:26,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:51:26,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:51:26,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:51:26,764 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-16 08:51:26,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:51:26,831 INFO L93 Difference]: Finished difference Result 338 states and 521 transitions. [2024-11-16 08:51:26,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:51:26,832 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-16 08:51:26,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:51:26,837 INFO L225 Difference]: With dead ends: 338 [2024-11-16 08:51:26,837 INFO L226 Difference]: Without dead ends: 311 [2024-11-16 08:51:26,838 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-16 08:51:26,839 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-16 08:51:26,839 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-16 08:51:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-16 08:51:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 310. [2024-11-16 08:51:26,873 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-16 08:51:26,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 481 transitions. [2024-11-16 08:51:26,877 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 481 transitions. Word has length 85 [2024-11-16 08:51:26,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:51:26,877 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 481 transitions. [2024-11-16 08:51:26,877 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-16 08:51:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 481 transitions. [2024-11-16 08:51:26,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-16 08:51:26,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:51:26,881 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-16 08:51:26,899 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-16 08:51:27,085 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-16 08:51:27,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:51:27,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:51:27,086 INFO L85 PathProgramCache]: Analyzing trace with hash -656512587, now seen corresponding path program 1 times [2024-11-16 08:51:27,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:51:27,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373826001] [2024-11-16 08:51:27,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:51:27,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:51:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 08:51:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:51:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 08:51:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 08:51:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-16 08:51:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 08:51:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 08:51:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 08:51:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 08:51:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 08:51:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 08:51:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 08:51:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 08:51:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 08:51:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-16 08:51:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-16 08:51:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-16 08:51:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:27,566 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-16 08:51:27,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:51:27,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373826001] [2024-11-16 08:51:27,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373826001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:51:27,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312092483] [2024-11-16 08:51:27,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:51:27,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:51:27,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:51:27,569 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-16 08:51:27,570 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-16 08:51:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:28,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 08:51:28,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:51:28,065 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-16 08:51:28,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 08:51:28,223 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-16 08:51:28,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312092483] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 08:51:28,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 08:51:28,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2024-11-16 08:51:28,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318500842] [2024-11-16 08:51:28,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 08:51:28,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 08:51:28,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:51:28,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 08:51:28,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-16 08:51:28,225 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-16 08:51:30,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 08:51:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:51:31,081 INFO L93 Difference]: Finished difference Result 626 states and 979 transitions. [2024-11-16 08:51:31,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 08:51:31,082 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-16 08:51:31,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:51:31,087 INFO L225 Difference]: With dead ends: 626 [2024-11-16 08:51:31,088 INFO L226 Difference]: Without dead ends: 331 [2024-11-16 08:51:31,091 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-16 08:51:31,092 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 79 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.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, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-16 08:51:31,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 676 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-16 08:51:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-16 08:51:31,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 325. [2024-11-16 08:51:31,131 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-16 08:51:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 501 transitions. [2024-11-16 08:51:31,135 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 501 transitions. Word has length 151 [2024-11-16 08:51:31,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:51:31,135 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 501 transitions. [2024-11-16 08:51:31,135 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-16 08:51:31,136 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 501 transitions. [2024-11-16 08:51:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 08:51:31,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:51:31,142 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-16 08:51:31,164 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-16 08:51:31,342 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-16 08:51:31,343 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:51:31,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:51:31,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1822564096, now seen corresponding path program 1 times [2024-11-16 08:51:31,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:51:31,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279458549] [2024-11-16 08:51:31,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:51:31,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:51:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 08:51:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:51:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 08:51:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 08:51:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-16 08:51:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 08:51:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 08:51:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 08:51:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 08:51:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 08:51:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 08:51:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 08:51:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 08:51:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 08:51:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-16 08:51:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-16 08:51:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 08:51:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:32,216 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-16 08:51:32,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:51:32,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279458549] [2024-11-16 08:51:32,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279458549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:51:32,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:51:32,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 08:51:32,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153956243] [2024-11-16 08:51:32,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:51:32,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 08:51:32,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:51:32,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 08:51:32,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 08:51:32,219 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-16 08:51:36,289 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-16 08:51:37,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 08:51:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:51:38,654 INFO L93 Difference]: Finished difference Result 907 states and 1433 transitions. [2024-11-16 08:51:38,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 08:51:38,655 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-16 08:51:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:51:38,664 INFO L225 Difference]: With dead ends: 907 [2024-11-16 08:51:38,664 INFO L226 Difference]: Without dead ends: 625 [2024-11-16 08:51:38,666 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-16 08:51:38,666 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 352 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 301 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-16 08:51:38,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 872 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 481 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2024-11-16 08:51:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-16 08:51:38,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 608. [2024-11-16 08:51:38,733 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-16 08:51:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 957 transitions. [2024-11-16 08:51:38,738 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 957 transitions. Word has length 162 [2024-11-16 08:51:38,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:51:38,738 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 957 transitions. [2024-11-16 08:51:38,739 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-16 08:51:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 957 transitions. [2024-11-16 08:51:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 08:51:38,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:51:38,744 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-16 08:51:38,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 08:51:38,744 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:51:38,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:51:38,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1160374620, now seen corresponding path program 1 times [2024-11-16 08:51:38,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:51:38,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607736715] [2024-11-16 08:51:38,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:51:38,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:51:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 08:51:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:51:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 08:51:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 08:51:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-16 08:51:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 08:51:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 08:51:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 08:51:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 08:51:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 08:51:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 08:51:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 08:51:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 08:51:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 08:51:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-16 08:51:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-16 08:51:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 08:51:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:39,629 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-16 08:51:39,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:51:39,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607736715] [2024-11-16 08:51:39,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607736715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:51:39,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:51:39,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 08:51:39,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679500713] [2024-11-16 08:51:39,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:51:39,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 08:51:39,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:51:39,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 08:51:39,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 08:51:39,631 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-16 08:51:41,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:51:41,811 INFO L93 Difference]: Finished difference Result 951 states and 1491 transitions. [2024-11-16 08:51:41,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 08:51:41,812 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-16 08:51:41,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:51:41,818 INFO L225 Difference]: With dead ends: 951 [2024-11-16 08:51:41,818 INFO L226 Difference]: Without dead ends: 598 [2024-11-16 08:51:41,819 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-16 08:51:41,821 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 434 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-16 08:51:41,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 920 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-16 08:51:41,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-16 08:51:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 578. [2024-11-16 08:51:41,872 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-16 08:51:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 895 transitions. [2024-11-16 08:51:41,876 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 895 transitions. Word has length 162 [2024-11-16 08:51:41,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:51:41,877 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 895 transitions. [2024-11-16 08:51:41,877 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-16 08:51:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 895 transitions. [2024-11-16 08:51:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 08:51:41,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:51:41,881 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-16 08:51:41,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 08:51:41,882 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:51:41,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:51:41,882 INFO L85 PathProgramCache]: Analyzing trace with hash 773908256, now seen corresponding path program 1 times [2024-11-16 08:51:41,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:51:41,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646169916] [2024-11-16 08:51:41,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:51:41,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:51:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 08:51:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:51:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 08:51:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 08:51:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-16 08:51:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 08:51:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 08:51:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 08:51:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 08:51:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 08:51:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 08:51:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 08:51:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 08:51:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 08:51:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-16 08:51:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-16 08:51:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 08:51:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:42,590 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-16 08:51:42,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:51:42,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646169916] [2024-11-16 08:51:42,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646169916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:51:42,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:51:42,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 08:51:42,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875350152] [2024-11-16 08:51:42,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:51:42,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 08:51:42,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:51:42,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 08:51:42,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 08:51:42,593 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-16 08:51:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:51:44,427 INFO L93 Difference]: Finished difference Result 908 states and 1389 transitions. [2024-11-16 08:51:44,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 08:51:44,428 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-16 08:51:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:51:44,432 INFO L225 Difference]: With dead ends: 908 [2024-11-16 08:51:44,433 INFO L226 Difference]: Without dead ends: 561 [2024-11-16 08:51:44,434 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-16 08:51:44,435 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 280 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-16 08:51:44,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 929 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-16 08:51:44,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-11-16 08:51:44,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 541. [2024-11-16 08:51:44,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-16 08:51:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 812 transitions. [2024-11-16 08:51:44,486 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 812 transitions. Word has length 162 [2024-11-16 08:51:44,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:51:44,486 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 812 transitions. [2024-11-16 08:51:44,486 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-16 08:51:44,487 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 812 transitions. [2024-11-16 08:51:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 08:51:44,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:51:44,490 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-16 08:51:44,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 08:51:44,490 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:51:44,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:51:44,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1441122496, now seen corresponding path program 1 times [2024-11-16 08:51:44,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:51:44,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040492873] [2024-11-16 08:51:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:51:44,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:51:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 08:51:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:51:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 08:51:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 08:51:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-16 08:51:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 08:51:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 08:51:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 08:51:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 08:51:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 08:51:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 08:51:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 08:51:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 08:51:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 08:51:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-16 08:51:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-16 08:51:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 08:51:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:45,395 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-16 08:51:45,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:51:45,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040492873] [2024-11-16 08:51:45,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040492873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:51:45,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:51:45,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 08:51:45,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871421789] [2024-11-16 08:51:45,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:51:45,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 08:51:45,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:51:45,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 08:51:45,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 08:51:45,398 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-16 08:51:47,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 08:51:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:51:49,374 INFO L93 Difference]: Finished difference Result 602 states and 896 transitions. [2024-11-16 08:51:49,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 08:51:49,375 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-16 08:51:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:51:49,379 INFO L225 Difference]: With dead ends: 602 [2024-11-16 08:51:49,379 INFO L226 Difference]: Without dead ends: 475 [2024-11-16 08:51:49,380 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-16 08:51:49,381 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 408 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-16 08:51:49,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 996 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-16 08:51:49,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-16 08:51:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 456. [2024-11-16 08:51:49,424 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-16 08:51:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 682 transitions. [2024-11-16 08:51:49,427 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 682 transitions. Word has length 162 [2024-11-16 08:51:49,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:51:49,427 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 682 transitions. [2024-11-16 08:51:49,427 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-16 08:51:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 682 transitions. [2024-11-16 08:51:49,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-16 08:51:49,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:51:49,431 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-16 08:51:49,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 08:51:49,432 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:51:49,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:51:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash 443973894, now seen corresponding path program 1 times [2024-11-16 08:51:49,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:51:49,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70282] [2024-11-16 08:51:49,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:51:49,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:51:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 08:51:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 08:51:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:51:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 08:51:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:51:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 08:51:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 08:51:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 08:51:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 08:51:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 08:51:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 08:51:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 08:51:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 08:51:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 08:51:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-16 08:51:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-16 08:51:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-16 08:51:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-16 08:51:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-16 08:51:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-16 08:51:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-16 08:51:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-16 08:51:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-16 08:51:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-16 08:51:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:50,531 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-16 08:51:50,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:51:50,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70282] [2024-11-16 08:51:50,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:51:50,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355035756] [2024-11-16 08:51:50,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:51:50,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:51:50,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:51:50,534 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-16 08:51:50,535 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-16 08:51:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:51,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 1549 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 08:51:51,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:51:51,268 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-16 08:51:51,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 08:51:51,760 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-16 08:51:51,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355035756] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 08:51:51,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 08:51:51,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 16 [2024-11-16 08:51:51,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528947469] [2024-11-16 08:51:51,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 08:51:51,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 08:51:51,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:51:51,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 08:51:51,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-16 08:51:51,764 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-16 08:51:56,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:51:56,112 INFO L93 Difference]: Finished difference Result 1126 states and 1736 transitions. [2024-11-16 08:51:56,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 08:51:56,113 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-16 08:51:56,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:51:56,118 INFO L225 Difference]: With dead ends: 1126 [2024-11-16 08:51:56,118 INFO L226 Difference]: Without dead ends: 719 [2024-11-16 08:51:56,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2024-11-16 08:51:56,121 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 691 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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.5s IncrementalHoareTripleChecker+Time [2024-11-16 08:51:56,122 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.5s Time] [2024-11-16 08:51:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-16 08:51:56,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 689. [2024-11-16 08:51:56,184 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-16 08:51:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1048 transitions. [2024-11-16 08:51:56,189 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1048 transitions. Word has length 221 [2024-11-16 08:51:56,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:51:56,190 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1048 transitions. [2024-11-16 08:51:56,191 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-16 08:51:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1048 transitions. [2024-11-16 08:51:56,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-16 08:51:56,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:51:56,196 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-16 08:51:56,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 08:51:56,396 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-16 08:51:56,397 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:51:56,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:51:56,397 INFO L85 PathProgramCache]: Analyzing trace with hash 682525894, now seen corresponding path program 1 times [2024-11-16 08:51:56,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:51:56,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780997175] [2024-11-16 08:51:56,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:51:56,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:51:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:57,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 08:51:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 08:51:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:51:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 08:51:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:51:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 08:51:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 08:51:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 08:51:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 08:51:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 08:51:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 08:51:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 08:51:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 08:51:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 08:51:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 08:51:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-16 08:51:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-16 08:51:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-16 08:51:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-16 08:51:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-16 08:51:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-16 08:51:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-16 08:51:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-16 08:51:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-16 08:51:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-16 08:51:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:51:59,707 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-16 08:51:59,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:51:59,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780997175] [2024-11-16 08:51:59,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780997175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:51:59,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169794483] [2024-11-16 08:51:59,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:51:59,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:51:59,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:51:59,710 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-16 08:51:59,712 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-16 08:52:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:00,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 1647 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-16 08:52:00,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:52:00,674 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-16 08:52:03,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 08:52:03,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 08:52:03,315 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-16 08:52:04,732 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-16 08:52:04,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-16 08:52:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 473 proven. 4 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-16 08:52:25,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 08:52:25,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2024-11-16 08:52:25,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2024-11-16 08:52:25,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-16 08:52:25,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2024-11-16 08:52:25,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-16 08:52:25,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2024-11-16 08:52:26,134 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-16 08:52:26,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169794483] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 08:52:26,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 08:52:26,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 9] total 39 [2024-11-16 08:52:26,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906138337] [2024-11-16 08:52:26,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 08:52:26,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-16 08:52:26,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:52:26,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-16 08:52:26,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1335, Unknown=1, NotChecked=0, Total=1482 [2024-11-16 08:52:26,138 INFO L87 Difference]: Start difference. First operand 689 states and 1048 transitions. Second operand has 39 states, 36 states have (on average 4.583333333333333) internal successors, (165), 35 states have internal predecessors, (165), 18 states have call successors, (66), 13 states have call predecessors, (66), 14 states have return successors, (66), 16 states have call predecessors, (66), 18 states have call successors, (66) [2024-11-16 08:52:30,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 08:52:32,893 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-16 08:52:34,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 08:52:36,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 08:52:41,330 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 []