./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-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 0d3b5dee297a010530e733718cca08900e46ab18a4a35ca825ad2e8828fb51c7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:43:43,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:43:43,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:43:43,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:43:43,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:43:43,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:43:43,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:43:43,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:43:43,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:43:43,999 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:43:43,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:43:43,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:43:43,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:43:44,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:43:44,000 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:43:44,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:43:44,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:43:44,000 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:43:44,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:43:44,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:43:44,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:43:44,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:43:44,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:43:44,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:43:44,006 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:43:44,007 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:43:44,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:43:44,007 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:43:44,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:43:44,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:43:44,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:43:44,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:43:44,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:43:44,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:43:44,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:43:44,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:43:44,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:43:44,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:43:44,009 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:43:44,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:43:44,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:43:44,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:43:44,010 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 -> 0d3b5dee297a010530e733718cca08900e46ab18a4a35ca825ad2e8828fb51c7 [2024-11-20 08:43:44,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:43:44,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:43:44,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:43:44,209 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:43:44,210 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:43:44,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.i [2024-11-20 08:43:45,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:43:45,611 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:43:45,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.i [2024-11-20 08:43:45,621 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a852c64c/aa40f170ee744990b2128f122646287c/FLAG1ea3465c5 [2024-11-20 08:43:45,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a852c64c/aa40f170ee744990b2128f122646287c [2024-11-20 08:43:45,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:43:45,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:43:45,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:43:45,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:43:45,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:43:45,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:43:45" (1/1) ... [2024-11-20 08:43:45,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d58a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:45, skipping insertion in model container [2024-11-20 08:43:45,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:43:45" (1/1) ... [2024-11-20 08:43:45,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:43:45,810 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.i[915,928] [2024-11-20 08:43:45,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:43:45,882 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:43:45,890 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.i[915,928] [2024-11-20 08:43:45,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:43:45,941 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:43:45,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:45 WrapperNode [2024-11-20 08:43:45,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:43:45,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:43:45,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:43:45,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:43:45,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:45" (1/1) ... [2024-11-20 08:43:45,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:45" (1/1) ... [2024-11-20 08:43:46,042 INFO L138 Inliner]: procedures = 29, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 538 [2024-11-20 08:43:46,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:43:46,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:43:46,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:43:46,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:43:46,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:45" (1/1) ... [2024-11-20 08:43:46,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:45" (1/1) ... [2024-11-20 08:43:46,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:45" (1/1) ... [2024-11-20 08:43:46,079 INFO L175 MemorySlicer]: Split 131 memory accesses to 11 slices as follows [2, 12, 14, 22, 16, 14, 12, 8, 7, 14, 10]. 17 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 1, 1, 1, 1, 1, 4, 1, 3, 1, 1]. [2024-11-20 08:43:46,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:45" (1/1) ... [2024-11-20 08:43:46,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:45" (1/1) ... [2024-11-20 08:43:46,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:45" (1/1) ... [2024-11-20 08:43:46,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:45" (1/1) ... [2024-11-20 08:43:46,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:45" (1/1) ... [2024-11-20 08:43:46,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:45" (1/1) ... [2024-11-20 08:43:46,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:43:46,115 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:43:46,115 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:43:46,115 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:43:46,116 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:45" (1/1) ... [2024-11-20 08:43:46,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:43:46,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:43:46,146 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-20 08:43:46,148 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-20 08:43:46,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:43:46,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-20 08:43:46,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-20 08:43:46,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-20 08:43:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-20 08:43:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-20 08:43:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-20 08:43:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-20 08:43:46,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-20 08:43:46,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-20 08:43:46,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-20 08:43:46,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-20 08:43:46,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 08:43:46,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 08:43:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 08:43:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 08:43:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 08:43:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-20 08:43:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-20 08:43:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-20 08:43:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-20 08:43:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-20 08:43:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-20 08:43:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-20 08:43:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-20 08:43:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-20 08:43:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-20 08:43:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-20 08:43:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-20 08:43:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-20 08:43:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-20 08:43:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-20 08:43:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-20 08:43:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-20 08:43:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 08:43:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 08:43:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 08:43:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 08:43:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-20 08:43:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-20 08:43:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-20 08:43:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-20 08:43:46,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-20 08:43:46,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-20 08:43:46,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-20 08:43:46,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-20 08:43:46,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-20 08:43:46,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-20 08:43:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-20 08:43:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-20 08:43:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-20 08:43:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-20 08:43:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-20 08:43:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-20 08:43:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-20 08:43:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-20 08:43:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:43:46,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:43:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:43:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 08:43:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 08:43:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 08:43:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-20 08:43:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-20 08:43:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-20 08:43:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-20 08:43:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-20 08:43:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-20 08:43:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-20 08:43:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:43:46,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:43:46,367 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:43:46,369 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:43:46,806 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-20 08:43:46,807 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:43:46,817 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:43:46,819 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:43:46,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:43:46 BoogieIcfgContainer [2024-11-20 08:43:46,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:43:46,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:43:46,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:43:46,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:43:46,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:43:45" (1/3) ... [2024-11-20 08:43:46,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdb5062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:43:46, skipping insertion in model container [2024-11-20 08:43:46,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:43:45" (2/3) ... [2024-11-20 08:43:46,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdb5062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:43:46, skipping insertion in model container [2024-11-20 08:43:46,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:43:46" (3/3) ... [2024-11-20 08:43:46,828 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-2.i [2024-11-20 08:43:46,840 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:43:46,840 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:43:46,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:43:46,894 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;@26f55f49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:43:46,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:43:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 08:43:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 08:43:46,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:43:46,906 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:43:46,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:43:46,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:43:46,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1065459933, now seen corresponding path program 1 times [2024-11-20 08:43:46,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:43:46,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344645405] [2024-11-20 08:43:46,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:43:46,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:43:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:43:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:43:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:43:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:43:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:43:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:43:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:43:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:43:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:43:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:43:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:43:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:43:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:43:47,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:43:47,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344645405] [2024-11-20 08:43:47,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344645405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:43:47,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:43:47,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:43:47,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384688097] [2024-11-20 08:43:47,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:43:47,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:43:47,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:43:47,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:43:47,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:43:47,293 INFO L87 Difference]: Start difference. First operand has 104 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 08:43:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:43:47,319 INFO L93 Difference]: Finished difference Result 201 states and 314 transitions. [2024-11-20 08:43:47,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:43:47,321 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-20 08:43:47,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:43:47,329 INFO L225 Difference]: With dead ends: 201 [2024-11-20 08:43:47,330 INFO L226 Difference]: Without dead ends: 100 [2024-11-20 08:43:47,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-20 08:43:47,336 INFO L432 NwaCegarLoop]: 147 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, 147 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-20 08:43:47,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:43:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-20 08:43:47,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-20 08:43:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.430232558139535) internal successors, (123), 86 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 08:43:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2024-11-20 08:43:47,376 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 100 [2024-11-20 08:43:47,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:43:47,377 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2024-11-20 08:43:47,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 08:43:47,378 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2024-11-20 08:43:47,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 08:43:47,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:43:47,383 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:43:47,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:43:47,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:43:47,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:43:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1912297295, now seen corresponding path program 1 times [2024-11-20 08:43:47,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:43:47,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140230502] [2024-11-20 08:43:47,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:43:47,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:43:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:43:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:43:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:43:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:43:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:43:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:43:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:43:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:43:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:43:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:43:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:43:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:43:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:43:47,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:43:47,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140230502] [2024-11-20 08:43:47,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140230502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:43:47,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:43:47,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:43:47,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268955480] [2024-11-20 08:43:47,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:43:47,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:43:47,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:43:47,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:43:47,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:43:47,583 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:43:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:43:47,607 INFO L93 Difference]: Finished difference Result 198 states and 293 transitions. [2024-11-20 08:43:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:43:47,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-11-20 08:43:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:43:47,609 INFO L225 Difference]: With dead ends: 198 [2024-11-20 08:43:47,609 INFO L226 Difference]: Without dead ends: 101 [2024-11-20 08:43:47,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-20 08:43:47,610 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 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-20 08:43:47,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:43:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-20 08:43:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-20 08:43:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 87 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 08:43:47,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 148 transitions. [2024-11-20 08:43:47,618 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 148 transitions. Word has length 100 [2024-11-20 08:43:47,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:43:47,619 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 148 transitions. [2024-11-20 08:43:47,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:43:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 148 transitions. [2024-11-20 08:43:47,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 08:43:47,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:43:47,621 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:43:47,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:43:47,621 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:43:47,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:43:47,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1371552751, now seen corresponding path program 1 times [2024-11-20 08:43:47,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:43:47,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327356532] [2024-11-20 08:43:47,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:43:47,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:43:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:43:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:43:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:43:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:43:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:43:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:43:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:43:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:43:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:43:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:43:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:43:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:43:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:43:47,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:43:47,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327356532] [2024-11-20 08:43:47,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327356532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:43:47,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:43:47,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:43:47,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335568237] [2024-11-20 08:43:47,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:43:47,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:43:47,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:43:47,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:43:47,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:43:47,812 INFO L87 Difference]: Start difference. First operand 101 states and 148 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 08:43:47,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:43:47,845 INFO L93 Difference]: Finished difference Result 201 states and 296 transitions. [2024-11-20 08:43:47,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:43:47,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-20 08:43:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:43:47,847 INFO L225 Difference]: With dead ends: 201 [2024-11-20 08:43:47,847 INFO L226 Difference]: Without dead ends: 103 [2024-11-20 08:43:47,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:43:47,848 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:43:47,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:43:47,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-20 08:43:47,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-20 08:43:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 89 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 08:43:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2024-11-20 08:43:47,861 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 100 [2024-11-20 08:43:47,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:43:47,861 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2024-11-20 08:43:47,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 08:43:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2024-11-20 08:43:47,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 08:43:47,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:43:47,863 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:43:47,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:43:47,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:43:47,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:43:47,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2079409043, now seen corresponding path program 1 times [2024-11-20 08:43:47,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:43:47,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189025755] [2024-11-20 08:43:47,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:43:47,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:43:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:43:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:43:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:43:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:43:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:43:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:43:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:43:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:43:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:43:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:43:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:43:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:43:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:43:48,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:43:48,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189025755] [2024-11-20 08:43:48,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189025755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:43:48,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:43:48,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:43:48,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894664266] [2024-11-20 08:43:48,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:43:48,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:43:48,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:43:48,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:43:48,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:43:48,048 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:43:48,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:43:48,075 INFO L93 Difference]: Finished difference Result 205 states and 300 transitions. [2024-11-20 08:43:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:43:48,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-11-20 08:43:48,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:43:48,077 INFO L225 Difference]: With dead ends: 205 [2024-11-20 08:43:48,078 INFO L226 Difference]: Without dead ends: 105 [2024-11-20 08:43:48,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:43:48,079 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:43:48,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:43:48,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-20 08:43:48,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-20 08:43:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 91 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 08:43:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 152 transitions. [2024-11-20 08:43:48,089 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 152 transitions. Word has length 100 [2024-11-20 08:43:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:43:48,089 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 152 transitions. [2024-11-20 08:43:48,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:43:48,090 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 152 transitions. [2024-11-20 08:43:48,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-20 08:43:48,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:43:48,091 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:43:48,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 08:43:48,091 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:43:48,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:43:48,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1798106899, now seen corresponding path program 1 times [2024-11-20 08:43:48,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:43:48,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090961360] [2024-11-20 08:43:48,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:43:48,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:43:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:43:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:43:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:43:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:43:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:43:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:43:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:43:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:43:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:43:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:43:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:43:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:43:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:43:48,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:43:48,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090961360] [2024-11-20 08:43:48,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090961360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:43:48,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:43:48,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:43:48,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323160457] [2024-11-20 08:43:48,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:43:48,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:43:48,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:43:48,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:43:48,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:43:48,226 INFO L87 Difference]: Start difference. First operand 105 states and 152 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:43:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:43:48,265 INFO L93 Difference]: Finished difference Result 252 states and 368 transitions. [2024-11-20 08:43:48,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:43:48,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-20 08:43:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:43:48,267 INFO L225 Difference]: With dead ends: 252 [2024-11-20 08:43:48,267 INFO L226 Difference]: Without dead ends: 150 [2024-11-20 08:43:48,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-20 08:43:48,268 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 60 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:43:48,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 288 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:43:48,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-20 08:43:48,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 123. [2024-11-20 08:43:48,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 109 states have (on average 1.4311926605504588) internal successors, (156), 109 states have internal predecessors, (156), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 08:43:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2024-11-20 08:43:48,281 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 103 [2024-11-20 08:43:48,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:43:48,281 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2024-11-20 08:43:48,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:43:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2024-11-20 08:43:48,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-20 08:43:48,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:43:48,283 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:43:48,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 08:43:48,283 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:43:48,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:43:48,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1400245400, now seen corresponding path program 1 times [2024-11-20 08:43:48,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:43:48,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083025995] [2024-11-20 08:43:48,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:43:48,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:43:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:43:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:43:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:43:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:43:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:43:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:43:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:43:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:43:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:43:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:43:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:43:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:43:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:43:48,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:43:48,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083025995] [2024-11-20 08:43:48,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083025995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:43:48,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:43:48,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:43:48,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499492582] [2024-11-20 08:43:48,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:43:48,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:43:48,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:43:48,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:43:48,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:43:48,379 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:43:48,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:43:48,394 INFO L93 Difference]: Finished difference Result 244 states and 359 transitions. [2024-11-20 08:43:48,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:43:48,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-20 08:43:48,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:43:48,396 INFO L225 Difference]: With dead ends: 244 [2024-11-20 08:43:48,396 INFO L226 Difference]: Without dead ends: 124 [2024-11-20 08:43:48,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-20 08:43:48,397 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:43:48,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:43:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-20 08:43:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-20 08:43:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 110 states have (on average 1.4272727272727272) internal successors, (157), 110 states have internal predecessors, (157), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 08:43:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 181 transitions. [2024-11-20 08:43:48,403 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 181 transitions. Word has length 103 [2024-11-20 08:43:48,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:43:48,403 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 181 transitions. [2024-11-20 08:43:48,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:43:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2024-11-20 08:43:48,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-20 08:43:48,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:43:48,405 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:43:48,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 08:43:48,405 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:43:48,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:43:48,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2080303770, now seen corresponding path program 1 times [2024-11-20 08:43:48,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:43:48,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518156048] [2024-11-20 08:43:48,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:43:48,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:43:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:49,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:43:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:49,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:43:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:49,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:43:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:49,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:43:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:49,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:43:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:49,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:43:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:49,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:43:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:49,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:43:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:49,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:43:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:49,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:43:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:49,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:43:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:49,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:43:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:43:49,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:43:49,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518156048] [2024-11-20 08:43:49,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518156048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:43:49,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:43:49,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:43:49,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171858938] [2024-11-20 08:43:49,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:43:49,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:43:49,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:43:49,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:43:49,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:43:49,136 INFO L87 Difference]: Start difference. First operand 124 states and 181 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 08:43:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:43:49,410 INFO L93 Difference]: Finished difference Result 308 states and 446 transitions. [2024-11-20 08:43:49,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:43:49,411 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-11-20 08:43:49,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:43:49,412 INFO L225 Difference]: With dead ends: 308 [2024-11-20 08:43:49,412 INFO L226 Difference]: Without dead ends: 187 [2024-11-20 08:43:49,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-20 08:43:49,413 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 437 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:43:49,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 687 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:43:49,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-20 08:43:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2024-11-20 08:43:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 167 states have (on average 1.4191616766467066) internal successors, (237), 168 states have internal predecessors, (237), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 08:43:49,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 265 transitions. [2024-11-20 08:43:49,427 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 265 transitions. Word has length 103 [2024-11-20 08:43:49,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:43:49,428 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 265 transitions. [2024-11-20 08:43:49,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 08:43:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 265 transitions. [2024-11-20 08:43:49,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-20 08:43:49,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:43:49,431 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:43:49,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 08:43:49,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:43:49,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:43:49,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1398045499, now seen corresponding path program 1 times [2024-11-20 08:43:49,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:43:49,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545108080] [2024-11-20 08:43:49,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:43:49,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:43:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 08:43:49,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1890402564] [2024-11-20 08:43:49,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:43:49,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:43:49,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:43:49,528 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-20 08:43:49,529 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-20 08:43:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:49,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 08:43:49,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:43:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:43:49,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:43:49,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:43:49,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545108080] [2024-11-20 08:43:49,861 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 08:43:49,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890402564] [2024-11-20 08:43:49,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890402564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:43:49,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:43:49,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:43:49,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108693644] [2024-11-20 08:43:49,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:43:49,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:43:49,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:43:49,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:43:49,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:43:49,863 INFO L87 Difference]: Start difference. First operand 184 states and 265 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:43:49,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:43:49,933 INFO L93 Difference]: Finished difference Result 510 states and 739 transitions. [2024-11-20 08:43:49,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:43:49,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-20 08:43:49,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:43:49,936 INFO L225 Difference]: With dead ends: 510 [2024-11-20 08:43:49,936 INFO L226 Difference]: Without dead ends: 329 [2024-11-20 08:43:49,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:43:49,940 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 138 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:43:49,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 415 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:43:49,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-20 08:43:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 258. [2024-11-20 08:43:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 228 states have (on average 1.4035087719298245) internal successors, (320), 229 states have internal predecessors, (320), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 08:43:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 372 transitions. [2024-11-20 08:43:49,953 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 372 transitions. Word has length 105 [2024-11-20 08:43:49,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:43:49,953 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 372 transitions. [2024-11-20 08:43:49,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:43:49,953 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 372 transitions. [2024-11-20 08:43:49,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-20 08:43:49,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:43:49,954 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:43:49,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 08:43:50,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:43:50,155 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:43:50,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:43:50,156 INFO L85 PathProgramCache]: Analyzing trace with hash 226493857, now seen corresponding path program 1 times [2024-11-20 08:43:50,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:43:50,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890007731] [2024-11-20 08:43:50,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:43:50,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:43:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:50,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:43:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:50,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:43:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:50,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:43:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:50,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:43:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:50,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:43:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:50,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:43:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:50,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:43:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:50,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:43:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:50,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:43:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:50,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:43:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:50,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:43:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:50,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:43:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:43:50,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:43:50,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890007731] [2024-11-20 08:43:50,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890007731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:43:50,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:43:50,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:43:50,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888633184] [2024-11-20 08:43:50,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:43:50,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:43:50,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:43:50,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:43:50,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:43:50,788 INFO L87 Difference]: Start difference. First operand 258 states and 372 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-20 08:43:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:43:51,225 INFO L93 Difference]: Finished difference Result 593 states and 853 transitions. [2024-11-20 08:43:51,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:43:51,226 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 106 [2024-11-20 08:43:51,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:43:51,228 INFO L225 Difference]: With dead ends: 593 [2024-11-20 08:43:51,228 INFO L226 Difference]: Without dead ends: 412 [2024-11-20 08:43:51,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-20 08:43:51,230 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 296 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:43:51,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 634 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:43:51,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-20 08:43:51,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 330. [2024-11-20 08:43:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 300 states have (on average 1.43) internal successors, (429), 301 states have internal predecessors, (429), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 08:43:51,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 481 transitions. [2024-11-20 08:43:51,255 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 481 transitions. Word has length 106 [2024-11-20 08:43:51,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:43:51,256 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 481 transitions. [2024-11-20 08:43:51,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-20 08:43:51,256 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 481 transitions. [2024-11-20 08:43:51,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-20 08:43:51,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:43:51,258 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:43:51,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 08:43:51,258 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:43:51,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:43:51,258 INFO L85 PathProgramCache]: Analyzing trace with hash 927558435, now seen corresponding path program 1 times [2024-11-20 08:43:51,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:43:51,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037083743] [2024-11-20 08:43:51,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:43:51,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:43:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:51,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:43:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:51,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:43:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:51,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:43:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:51,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:43:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:51,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:43:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:51,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:43:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:51,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:43:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:51,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:43:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:51,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:43:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:51,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:43:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:51,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:43:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:51,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:43:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:43:51,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:43:51,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037083743] [2024-11-20 08:43:52,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037083743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:43:52,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:43:52,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 08:43:52,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423443525] [2024-11-20 08:43:52,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:43:52,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 08:43:52,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:43:52,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 08:43:52,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:43:52,001 INFO L87 Difference]: Start difference. First operand 330 states and 481 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 08:43:52,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:43:52,499 INFO L93 Difference]: Finished difference Result 758 states and 1109 transitions. [2024-11-20 08:43:52,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 08:43:52,499 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2024-11-20 08:43:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:43:52,502 INFO L225 Difference]: With dead ends: 758 [2024-11-20 08:43:52,502 INFO L226 Difference]: Without dead ends: 534 [2024-11-20 08:43:52,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2024-11-20 08:43:52,504 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 501 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:43:52,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1056 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:43:52,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-20 08:43:52,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 444. [2024-11-20 08:43:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 414 states have (on average 1.458937198067633) internal successors, (604), 415 states have internal predecessors, (604), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 08:43:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 656 transitions. [2024-11-20 08:43:52,528 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 656 transitions. Word has length 106 [2024-11-20 08:43:52,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:43:52,528 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 656 transitions. [2024-11-20 08:43:52,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 08:43:52,528 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 656 transitions. [2024-11-20 08:43:52,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 08:43:52,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:43:52,530 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:43:52,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 08:43:52,530 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:43:52,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:43:52,530 INFO L85 PathProgramCache]: Analyzing trace with hash 289481821, now seen corresponding path program 1 times [2024-11-20 08:43:52,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:43:52,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853814314] [2024-11-20 08:43:52,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:43:52,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:43:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:52,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:43:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:52,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:43:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:52,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:43:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:52,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:43:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:52,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:43:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:52,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:43:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:52,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:43:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:52,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:43:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:52,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:43:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:52,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:43:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:52,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:43:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:52,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:43:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:43:52,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:43:52,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853814314] [2024-11-20 08:43:52,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853814314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:43:52,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:43:52,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:43:52,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555160279] [2024-11-20 08:43:52,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:43:52,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:43:52,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:43:52,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:43:52,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:43:52,832 INFO L87 Difference]: Start difference. First operand 444 states and 656 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:43:52,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:43:52,969 INFO L93 Difference]: Finished difference Result 782 states and 1149 transitions. [2024-11-20 08:43:52,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:43:52,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-20 08:43:52,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:43:52,972 INFO L225 Difference]: With dead ends: 782 [2024-11-20 08:43:52,972 INFO L226 Difference]: Without dead ends: 496 [2024-11-20 08:43:52,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:43:52,973 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 68 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:43:52,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 830 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:43:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-20 08:43:52,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 456. [2024-11-20 08:43:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 426 states have (on average 1.4507042253521127) internal successors, (618), 427 states have internal predecessors, (618), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 08:43:52,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 670 transitions. [2024-11-20 08:43:52,989 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 670 transitions. Word has length 108 [2024-11-20 08:43:52,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:43:52,989 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 670 transitions. [2024-11-20 08:43:52,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:43:52,989 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 670 transitions. [2024-11-20 08:43:52,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 08:43:52,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:43:52,990 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:43:52,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 08:43:52,991 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:43:52,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:43:52,991 INFO L85 PathProgramCache]: Analyzing trace with hash -508915043, now seen corresponding path program 1 times [2024-11-20 08:43:52,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:43:52,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764259459] [2024-11-20 08:43:52,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:43:52,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:43:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:53,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:43:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:53,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:43:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:53,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:43:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:53,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:43:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:53,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:43:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:53,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:43:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:53,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:43:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:53,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:43:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:53,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:43:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:53,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:43:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:53,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:43:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:53,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:43:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:43:53,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:43:53,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764259459] [2024-11-20 08:43:53,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764259459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:43:53,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:43:53,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:43:53,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622065420] [2024-11-20 08:43:53,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:43:53,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:43:53,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:43:53,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:43:53,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:43:53,252 INFO L87 Difference]: Start difference. First operand 456 states and 670 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:43:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:43:53,446 INFO L93 Difference]: Finished difference Result 902 states and 1313 transitions. [2024-11-20 08:43:53,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:43:53,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-20 08:43:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:43:53,448 INFO L225 Difference]: With dead ends: 902 [2024-11-20 08:43:53,448 INFO L226 Difference]: Without dead ends: 600 [2024-11-20 08:43:53,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:43:53,449 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 87 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:43:53,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 843 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:43:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-20 08:43:53,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 476. [2024-11-20 08:43:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 445 states have (on average 1.4314606741573033) internal successors, (637), 446 states have internal predecessors, (637), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 08:43:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 689 transitions. [2024-11-20 08:43:53,482 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 689 transitions. Word has length 108 [2024-11-20 08:43:53,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:43:53,482 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 689 transitions. [2024-11-20 08:43:53,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:43:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 689 transitions. [2024-11-20 08:43:53,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 08:43:53,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:43:53,483 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:43:53,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 08:43:53,484 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:43:53,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:43:53,484 INFO L85 PathProgramCache]: Analyzing trace with hash -86213217, now seen corresponding path program 1 times [2024-11-20 08:43:53,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:43:53,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017576950] [2024-11-20 08:43:53,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:43:53,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:43:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:54,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:43:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:54,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:43:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:54,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:43:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:54,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:43:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:54,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:43:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:54,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:43:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:54,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:43:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:54,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:43:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:54,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:43:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:54,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:43:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:54,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:43:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:54,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:43:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:43:54,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:43:54,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017576950] [2024-11-20 08:43:54,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017576950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:43:54,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:43:54,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-20 08:43:54,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267182014] [2024-11-20 08:43:54,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:43:54,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-20 08:43:54,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:43:54,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-20 08:43:54,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-20 08:43:54,494 INFO L87 Difference]: Start difference. First operand 476 states and 689 transitions. Second operand has 19 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-20 08:43:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:43:55,588 INFO L93 Difference]: Finished difference Result 863 states and 1245 transitions. [2024-11-20 08:43:55,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 08:43:55,589 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) Word has length 108 [2024-11-20 08:43:55,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:43:55,590 INFO L225 Difference]: With dead ends: 863 [2024-11-20 08:43:55,591 INFO L226 Difference]: Without dead ends: 566 [2024-11-20 08:43:55,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2024-11-20 08:43:55,592 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 515 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 08:43:55,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1900 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 08:43:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-20 08:43:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 478. [2024-11-20 08:43:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 447 states have (on average 1.429530201342282) internal successors, (639), 448 states have internal predecessors, (639), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 08:43:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 691 transitions. [2024-11-20 08:43:55,609 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 691 transitions. Word has length 108 [2024-11-20 08:43:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:43:55,610 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 691 transitions. [2024-11-20 08:43:55,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-20 08:43:55,610 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 691 transitions. [2024-11-20 08:43:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 08:43:55,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:43:55,611 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:43:55,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 08:43:55,611 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:43:55,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:43:55,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1111326778, now seen corresponding path program 1 times [2024-11-20 08:43:55,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:43:55,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023018538] [2024-11-20 08:43:55,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:43:55,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:43:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:55,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:43:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:55,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:43:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:55,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:43:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:55,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:43:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:55,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:43:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:55,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:43:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:55,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:43:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:55,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:43:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:55,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:43:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:55,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:43:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:55,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:43:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:55,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:43:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:43:55,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:43:55,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023018538] [2024-11-20 08:43:55,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023018538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:43:55,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:43:55,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:43:55,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270456449] [2024-11-20 08:43:55,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:43:55,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:43:55,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:43:55,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:43:55,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:43:55,978 INFO L87 Difference]: Start difference. First operand 478 states and 691 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:43:56,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:43:56,234 INFO L93 Difference]: Finished difference Result 886 states and 1268 transitions. [2024-11-20 08:43:56,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:43:56,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-20 08:43:56,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:43:56,236 INFO L225 Difference]: With dead ends: 886 [2024-11-20 08:43:56,237 INFO L226 Difference]: Without dead ends: 587 [2024-11-20 08:43:56,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:43:56,238 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 141 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:43:56,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 850 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:43:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-11-20 08:43:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 488. [2024-11-20 08:43:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 457 states have (on average 1.424507658643326) internal successors, (651), 458 states have internal predecessors, (651), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 08:43:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 703 transitions. [2024-11-20 08:43:56,262 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 703 transitions. Word has length 109 [2024-11-20 08:43:56,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:43:56,263 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 703 transitions. [2024-11-20 08:43:56,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:43:56,263 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 703 transitions. [2024-11-20 08:43:56,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 08:43:56,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:43:56,264 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:43:56,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 08:43:56,264 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:43:56,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:43:56,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1698132792, now seen corresponding path program 1 times [2024-11-20 08:43:56,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:43:56,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710036822] [2024-11-20 08:43:56,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:43:56,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:43:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:57,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:43:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:57,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:43:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:57,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:43:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:57,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:43:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:57,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:43:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:57,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:43:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:57,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:43:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:57,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:43:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:57,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:43:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:57,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:43:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:57,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:43:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:57,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:43:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:43:57,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:43:57,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710036822] [2024-11-20 08:43:57,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710036822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:43:57,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:43:57,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-20 08:43:57,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143286816] [2024-11-20 08:43:57,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:43:57,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-20 08:43:57,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:43:57,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-20 08:43:57,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-20 08:43:57,439 INFO L87 Difference]: Start difference. First operand 488 states and 703 transitions. Second operand has 20 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-20 08:43:58,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:43:58,858 INFO L93 Difference]: Finished difference Result 936 states and 1341 transitions. [2024-11-20 08:43:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 08:43:58,858 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Word has length 109 [2024-11-20 08:43:58,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:43:58,860 INFO L225 Difference]: With dead ends: 936 [2024-11-20 08:43:58,861 INFO L226 Difference]: Without dead ends: 631 [2024-11-20 08:43:58,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2024-11-20 08:43:58,862 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 567 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:43:58,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1784 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 08:43:58,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-20 08:43:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 490. [2024-11-20 08:43:58,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 459 states have (on average 1.4248366013071896) internal successors, (654), 460 states have internal predecessors, (654), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 08:43:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 706 transitions. [2024-11-20 08:43:58,881 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 706 transitions. Word has length 109 [2024-11-20 08:43:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:43:58,881 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 706 transitions. [2024-11-20 08:43:58,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-20 08:43:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 706 transitions. [2024-11-20 08:43:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 08:43:58,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:43:58,883 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:43:58,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 08:43:58,883 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:43:58,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:43:58,884 INFO L85 PathProgramCache]: Analyzing trace with hash -997068214, now seen corresponding path program 1 times [2024-11-20 08:43:58,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:43:58,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275361080] [2024-11-20 08:43:58,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:43:58,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:43:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:59,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:43:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:59,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:43:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:59,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:43:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:59,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:43:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:59,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:43:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:59,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:43:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:59,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:43:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:59,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:43:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:59,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:43:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:59,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:43:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:59,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:43:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:59,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:43:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:43:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:43:59,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:43:59,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275361080] [2024-11-20 08:43:59,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275361080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:43:59,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:43:59,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-20 08:43:59,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124756592] [2024-11-20 08:43:59,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:43:59,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 08:43:59,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:43:59,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 08:43:59,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-20 08:43:59,794 INFO L87 Difference]: Start difference. First operand 490 states and 706 transitions. Second operand has 16 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-20 08:44:00,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:00,418 INFO L93 Difference]: Finished difference Result 848 states and 1223 transitions. [2024-11-20 08:44:00,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 08:44:00,419 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Word has length 109 [2024-11-20 08:44:00,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:00,420 INFO L225 Difference]: With dead ends: 848 [2024-11-20 08:44:00,420 INFO L226 Difference]: Without dead ends: 541 [2024-11-20 08:44:00,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2024-11-20 08:44:00,421 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 325 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:00,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1236 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:44:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-20 08:44:00,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 483. [2024-11-20 08:44:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 452 states have (on average 1.426991150442478) internal successors, (645), 453 states have internal predecessors, (645), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 08:44:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 697 transitions. [2024-11-20 08:44:00,438 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 697 transitions. Word has length 109 [2024-11-20 08:44:00,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:00,439 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 697 transitions. [2024-11-20 08:44:00,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-20 08:44:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 697 transitions. [2024-11-20 08:44:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 08:44:00,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:00,440 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:00,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 08:44:00,440 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:00,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash -392031852, now seen corresponding path program 1 times [2024-11-20 08:44:00,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:44:00,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819038166] [2024-11-20 08:44:00,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:00,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:44:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:00,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:44:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:00,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:44:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:00,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:44:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:00,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:44:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:00,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:44:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:00,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:44:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:00,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:44:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:00,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:44:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:00,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:44:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:00,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:44:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:00,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:44:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:00,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:44:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:00,863 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:00,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:44:00,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819038166] [2024-11-20 08:44:00,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819038166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:44:00,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:44:00,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 08:44:00,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741705155] [2024-11-20 08:44:00,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:00,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 08:44:00,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:44:00,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 08:44:00,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:44:00,865 INFO L87 Difference]: Start difference. First operand 483 states and 697 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 08:44:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:01,375 INFO L93 Difference]: Finished difference Result 887 states and 1267 transitions. [2024-11-20 08:44:01,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 08:44:01,375 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2024-11-20 08:44:01,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:01,377 INFO L225 Difference]: With dead ends: 887 [2024-11-20 08:44:01,378 INFO L226 Difference]: Without dead ends: 581 [2024-11-20 08:44:01,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-11-20 08:44:01,379 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 424 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:01,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1152 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:44:01,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-20 08:44:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 532. [2024-11-20 08:44:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 495 states have (on average 1.408080808080808) internal successors, (697), 497 states have internal predecessors, (697), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 08:44:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 757 transitions. [2024-11-20 08:44:01,408 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 757 transitions. Word has length 109 [2024-11-20 08:44:01,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:01,409 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 757 transitions. [2024-11-20 08:44:01,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 08:44:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 757 transitions. [2024-11-20 08:44:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-20 08:44:01,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:01,411 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:01,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 08:44:01,411 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:01,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:01,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1012500441, now seen corresponding path program 1 times [2024-11-20 08:44:01,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:44:01,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439122240] [2024-11-20 08:44:01,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:01,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:44:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:01,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:44:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:01,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:44:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:01,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:44:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:01,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:44:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:01,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:44:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:01,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:44:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:01,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:44:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:01,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:44:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:01,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:44:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:01,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:44:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:01,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:44:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:01,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:44:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:01,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:44:01,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439122240] [2024-11-20 08:44:01,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439122240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:44:01,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:44:01,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 08:44:01,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226306764] [2024-11-20 08:44:01,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:01,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 08:44:01,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:44:01,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 08:44:01,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:44:01,834 INFO L87 Difference]: Start difference. First operand 532 states and 757 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 08:44:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:02,189 INFO L93 Difference]: Finished difference Result 969 states and 1367 transitions. [2024-11-20 08:44:02,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:44:02,189 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2024-11-20 08:44:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:02,192 INFO L225 Difference]: With dead ends: 969 [2024-11-20 08:44:02,192 INFO L226 Difference]: Without dead ends: 616 [2024-11-20 08:44:02,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-20 08:44:02,194 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 404 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:02,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 743 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:44:02,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-20 08:44:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 546. [2024-11-20 08:44:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 509 states have (on average 1.4007858546168959) internal successors, (713), 511 states have internal predecessors, (713), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 08:44:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 773 transitions. [2024-11-20 08:44:02,216 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 773 transitions. Word has length 110 [2024-11-20 08:44:02,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:02,217 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 773 transitions. [2024-11-20 08:44:02,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 08:44:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 773 transitions. [2024-11-20 08:44:02,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-20 08:44:02,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:02,219 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:02,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 08:44:02,219 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:02,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:02,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1713565019, now seen corresponding path program 1 times [2024-11-20 08:44:02,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:44:02,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084188334] [2024-11-20 08:44:02,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:02,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:44:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:03,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:44:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:03,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:44:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:03,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:44:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:03,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:44:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:03,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:44:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:03,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:44:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:03,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:44:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:03,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:44:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:03,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:44:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:03,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:44:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:03,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:44:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:03,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:44:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:03,091 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:03,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:44:03,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084188334] [2024-11-20 08:44:03,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084188334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:44:03,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:44:03,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-20 08:44:03,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963406978] [2024-11-20 08:44:03,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:03,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-20 08:44:03,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:44:03,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-20 08:44:03,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2024-11-20 08:44:03,093 INFO L87 Difference]: Start difference. First operand 546 states and 773 transitions. Second operand has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 19 states have internal predecessors, (53), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-20 08:44:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:04,204 INFO L93 Difference]: Finished difference Result 1129 states and 1585 transitions. [2024-11-20 08:44:04,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 08:44:04,205 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 19 states have internal predecessors, (53), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 110 [2024-11-20 08:44:04,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:04,207 INFO L225 Difference]: With dead ends: 1129 [2024-11-20 08:44:04,207 INFO L226 Difference]: Without dead ends: 766 [2024-11-20 08:44:04,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=1016, Unknown=0, NotChecked=0, Total=1190 [2024-11-20 08:44:04,208 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 236 mSDsluCounter, 2035 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:04,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 2226 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 08:44:04,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-11-20 08:44:04,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 751. [2024-11-20 08:44:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 700 states have (on average 1.3885714285714286) internal successors, (972), 704 states have internal predecessors, (972), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 08:44:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1052 transitions. [2024-11-20 08:44:04,241 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1052 transitions. Word has length 110 [2024-11-20 08:44:04,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:04,241 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1052 transitions. [2024-11-20 08:44:04,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 19 states have internal predecessors, (53), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-20 08:44:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1052 transitions. [2024-11-20 08:44:04,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 08:44:04,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:04,243 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:04,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 08:44:04,243 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:04,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:04,243 INFO L85 PathProgramCache]: Analyzing trace with hash 260020175, now seen corresponding path program 1 times [2024-11-20 08:44:04,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:44:04,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751917975] [2024-11-20 08:44:04,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:04,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:44:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 08:44:04,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [999975262] [2024-11-20 08:44:04,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:04,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:44:04,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:44:04,295 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-20 08:44:04,296 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-20 08:44:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:44:04,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 08:44:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:44:04,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 08:44:04,718 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 08:44:04,718 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 08:44:04,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 08:44:04,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-20 08:44:04,923 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:44:05,022 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 08:44:05,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:44:05 BoogieIcfgContainer [2024-11-20 08:44:05,024 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 08:44:05,025 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 08:44:05,025 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 08:44:05,025 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 08:44:05,025 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:43:46" (3/4) ... [2024-11-20 08:44:05,027 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 08:44:05,028 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 08:44:05,028 INFO L158 Benchmark]: Toolchain (without parser) took 19394.42ms. Allocated memory was 180.4MB in the beginning and 587.2MB in the end (delta: 406.8MB). Free memory was 112.2MB in the beginning and 335.9MB in the end (delta: -223.7MB). Peak memory consumption was 184.1MB. Max. memory is 16.1GB. [2024-11-20 08:44:05,029 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory is still 70.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:44:05,029 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.73ms. Allocated memory is still 180.4MB. Free memory was 112.0MB in the beginning and 95.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 08:44:05,029 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.22ms. Allocated memory is still 180.4MB. Free memory was 95.8MB in the beginning and 151.3MB in the end (delta: -55.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 08:44:05,029 INFO L158 Benchmark]: Boogie Preprocessor took 71.78ms. Allocated memory is still 180.4MB. Free memory was 151.3MB in the beginning and 145.6MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:44:05,029 INFO L158 Benchmark]: RCFGBuilder took 704.23ms. Allocated memory is still 180.4MB. Free memory was 145.6MB in the beginning and 100.3MB in the end (delta: 45.3MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-20 08:44:05,030 INFO L158 Benchmark]: TraceAbstraction took 18202.79ms. Allocated memory was 180.4MB in the beginning and 587.2MB in the end (delta: 406.8MB). Free memory was 99.5MB in the beginning and 335.9MB in the end (delta: -236.4MB). Peak memory consumption was 171.0MB. Max. memory is 16.1GB. [2024-11-20 08:44:05,030 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 587.2MB. Free memory is still 335.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:44:05,031 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory is still 70.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.73ms. Allocated memory is still 180.4MB. Free memory was 112.0MB in the beginning and 95.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.22ms. Allocated memory is still 180.4MB. Free memory was 95.8MB in the beginning and 151.3MB in the end (delta: -55.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.78ms. Allocated memory is still 180.4MB. Free memory was 151.3MB in the beginning and 145.6MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 704.23ms. Allocated memory is still 180.4MB. Free memory was 145.6MB in the beginning and 100.3MB in the end (delta: 45.3MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 18202.79ms. Allocated memory was 180.4MB in the beginning and 587.2MB in the end (delta: 406.8MB). Free memory was 99.5MB in the beginning and 335.9MB in the end (delta: -236.4MB). Peak memory consumption was 171.0MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 587.2MB. Free memory is still 335.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someUnaryDOUBLEoperation at line 36. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L22] unsigned short int var_1_1 = 10; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned short int var_1_5 = 200; [L24] unsigned short int var_1_5 = 200; [L25] unsigned short int* var_1_5_Pointer = &(var_1_5); [L26] unsigned short int var_1_6 = 56955; [L26] unsigned short int var_1_6 = 56955; [L27] unsigned short int* var_1_6_Pointer = &(var_1_6); [L28] unsigned short int var_1_7 = 32; [L28] unsigned short int var_1_7 = 32; [L29] unsigned short int* var_1_7_Pointer = &(var_1_7); [L30] unsigned short int var_1_8 = 1; [L30] unsigned short int var_1_8 = 1; [L31] unsigned short int* var_1_8_Pointer = &(var_1_8); [L32] unsigned short int var_1_9 = 8; [L32] unsigned short int var_1_9 = 8; [L33] unsigned short int* var_1_9_Pointer = &(var_1_9); [L34] unsigned char var_1_10 = 1; [L34] unsigned char var_1_10 = 1; [L35] unsigned char* var_1_10_Pointer = &(var_1_10); [L36] float var_1_11 = -0.6; [L36] float var_1_11 = -0.6; [L37] float* var_1_11_Pointer = &(var_1_11); [L38] float var_1_12 = 9.125; [L38] float var_1_12 = 9.125; [L39] float* var_1_12_Pointer = &(var_1_12); [L40] float var_1_13 = 50.5; [L40] float var_1_13 = 50.5; [L41] float* var_1_13_Pointer = &(var_1_13); [L42] unsigned short int last_1_var_1_1 = 10; [L43] unsigned short int last_1_var_1_9 = 8; VAL [isInitial=0, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L95] EXPR \read(var_1_1) [L95] last_1_var_1_1 = var_1_1 [L96] EXPR \read(var_1_9) [L96] last_1_var_1_9 = var_1_9 [L106] RET updateLastVariables() [L107] CALL updateVariables() [L74] var_1_5 = __VERIFIER_nondet_ushort() [L75] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L76] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L76] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L76] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L77] var_1_6 = __VERIFIER_nondet_ushort() [L78] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L78] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L78] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L80] var_1_7 = __VERIFIER_nondet_ushort() [L81] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L81] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L81] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L82] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L82] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L82] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L83] var_1_8 = __VERIFIER_nondet_ushort() [L84] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] var_1_10 = __VERIFIER_nondet_uchar() [L87] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] var_1_12 = __VERIFIER_nondet_float() [L90] EXPR \read(var_1_12) [L90] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F [L90] EXPR \read(var_1_12) [L90] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] var_1_13 = __VERIFIER_nondet_float() [L92] EXPR \read(var_1_13) [L92] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F [L92] EXPR \read(var_1_13) [L92] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] RET updateVariables() [L108] CALL step() [L47] COND TRUE last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1) [L48] EXPR \read(*var_1_5_Pointer) [L48] EXPR \read(*var_1_6_Pointer) [L48] EXPR \read(*var_1_7_Pointer) [L48] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L48] EXPR ((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))) [L48] EXPR \read(*var_1_8_Pointer) [L48] EXPR ((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L48] EXPR (((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))) [L48] EXPR \read(*var_1_5_Pointer) [L48] EXPR (((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L48] (*(var_1_1_Pointer)) = (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))) [L50] EXPR \read(*var_1_10_Pointer) [L50] (*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L50] (*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer))) [L50] EXPR \read(*var_1_6_Pointer) [L50] EXPR \read(*var_1_8_Pointer) [L50] (*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L50] COND FALSE !((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) [L61] EXPR \read(*var_1_6_Pointer) [L61] (*(var_1_9_Pointer)) = (*(var_1_6_Pointer)) [L63] EXPR \read(*var_1_7_Pointer) [L63] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L63] COND FALSE !((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) [L70] EXPR \read(*var_1_12_Pointer) [L70] (*(var_1_11_Pointer)) = (*(var_1_12_Pointer)) [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR (last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1 [L99] EXPR \read(*var_1_1_Pointer) [L99] EXPR \read(*var_1_5_Pointer) [L99] EXPR \read(*var_1_6_Pointer) [L99] EXPR \read(*var_1_7_Pointer) [L99] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR ((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))) [L99] EXPR \read(*var_1_8_Pointer) [L99] EXPR ((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR (((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))) [L99] EXPR \read(*var_1_5_Pointer) [L99] EXPR (((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR (last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1 VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR ((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR ((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer))))) [L99] EXPR \read(*var_1_10_Pointer) [L99] EXPR (*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR (*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer))) [L99] EXPR \read(*var_1_6_Pointer) [L99] EXPR \read(*var_1_8_Pointer) [L99] EXPR (*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR ((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))) [L99] EXPR \read(*var_1_9_Pointer) [L99] EXPR \read(*var_1_6_Pointer) [L99] EXPR ((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR ((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR (((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))))) && (((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) ? (((*(var_1_7_Pointer)) <= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR (((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))))) && (((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) ? (((*(var_1_7_Pointer)) <= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) [L99] EXPR \read(*var_1_7_Pointer) [L99] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR ((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) ? (((*(var_1_7_Pointer)) <= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer)))) [L99] EXPR \read(*var_1_11_Pointer) [L99] EXPR \read(*var_1_12_Pointer) [L99] EXPR ((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) ? (((*(var_1_7_Pointer)) <= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR (((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))))) && (((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) ? (((*(var_1_7_Pointer)) <= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99-L100] return (((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))))) && (((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) ? (((*(var_1_7_Pointer)) <= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.1s, OverallIterations: 20, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4199 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4199 mSDsluCounter, 16210 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13236 mSDsCounter, 242 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6353 IncrementalHoareTripleChecker+Invalid, 6595 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 242 mSolverCounterUnsat, 2974 mSDtfsCounter, 6353 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 837 GetRequests, 613 SyntacticMatches, 1 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=751occurred in iteration=19, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 957 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 2333 NumberOfCodeBlocks, 2333 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1987 ConstructedInterpolants, 0 QuantifiedInterpolants, 7193 SizeOfPredicates, 3 NumberOfNonLiveVariables, 456 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 5016/5016 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 08:44:05,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 0d3b5dee297a010530e733718cca08900e46ab18a4a35ca825ad2e8828fb51c7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:44:06,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:44:06,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 08:44:06,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:44:06,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:44:06,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:44:06,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:44:06,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:44:06,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:44:06,949 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:44:06,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:44:06,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:44:06,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:44:06,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:44:06,951 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:44:06,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:44:06,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:44:06,952 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:44:06,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:44:06,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:44:06,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:44:06,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:44:06,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:44:06,954 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 08:44:06,954 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 08:44:06,954 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:44:06,954 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 08:44:06,955 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:44:06,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:44:06,955 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:44:06,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:44:06,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:44:06,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:44:06,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:44:06,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:44:06,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:44:06,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:44:06,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:44:06,957 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 08:44:06,957 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 08:44:06,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:44:06,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:44:06,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:44:06,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:44:06,961 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 -> 0d3b5dee297a010530e733718cca08900e46ab18a4a35ca825ad2e8828fb51c7 [2024-11-20 08:44:07,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:44:07,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:44:07,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:44:07,223 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:44:07,224 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:44:07,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.i [2024-11-20 08:44:08,531 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:44:08,698 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:44:08,698 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.i [2024-11-20 08:44:08,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b508f2b8/91390e528c564701b956f659b3ed94f7/FLAG44aaf454c [2024-11-20 08:44:09,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b508f2b8/91390e528c564701b956f659b3ed94f7 [2024-11-20 08:44:09,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:44:09,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:44:09,090 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:44:09,090 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:44:09,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:44:09,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:44:09" (1/1) ... [2024-11-20 08:44:09,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5132ba45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:44:09, skipping insertion in model container [2024-11-20 08:44:09,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:44:09" (1/1) ... [2024-11-20 08:44:09,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:44:09,250 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.i[915,928] [2024-11-20 08:44:09,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:44:09,321 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:44:09,332 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.i[915,928] [2024-11-20 08:44:09,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:44:09,384 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:44:09,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:44:09 WrapperNode [2024-11-20 08:44:09,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:44:09,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:44:09,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:44:09,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:44:09,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:44:09" (1/1) ... [2024-11-20 08:44:09,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:44:09" (1/1) ... [2024-11-20 08:44:09,442 INFO L138 Inliner]: procedures = 33, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2024-11-20 08:44:09,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:44:09,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:44:09,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:44:09,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:44:09,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:44:09" (1/1) ... [2024-11-20 08:44:09,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:44:09" (1/1) ... [2024-11-20 08:44:09,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:44:09" (1/1) ... [2024-11-20 08:44:09,505 INFO L175 MemorySlicer]: Split 131 memory accesses to 11 slices as follows [2, 12, 14, 22, 16, 14, 12, 8, 7, 14, 10]. 17 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 1, 1, 1, 1, 1, 4, 1, 3, 1, 1]. [2024-11-20 08:44:09,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:44:09" (1/1) ... [2024-11-20 08:44:09,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:44:09" (1/1) ... [2024-11-20 08:44:09,526 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:44:09" (1/1) ... [2024-11-20 08:44:09,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:44:09" (1/1) ... [2024-11-20 08:44:09,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:44:09" (1/1) ... [2024-11-20 08:44:09,546 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:44:09" (1/1) ... [2024-11-20 08:44:09,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:44:09,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:44:09,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:44:09,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:44:09,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:44:09" (1/1) ... [2024-11-20 08:44:09,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:44:09,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:44:09,586 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-20 08:44:09,589 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-20 08:44:09,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:44:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 08:44:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 08:44:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 08:44:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-20 08:44:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-20 08:44:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-20 08:44:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-20 08:44:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-20 08:44:09,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-20 08:44:09,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-20 08:44:09,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-20 08:44:09,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-20 08:44:09,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-20 08:44:09,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-20 08:44:09,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-20 08:44:09,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-20 08:44:09,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-20 08:44:09,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-20 08:44:09,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-20 08:44:09,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-20 08:44:09,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-20 08:44:09,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-20 08:44:09,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 08:44:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 08:44:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 08:44:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-20 08:44:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-20 08:44:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-20 08:44:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-20 08:44:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-20 08:44:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-20 08:44:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-20 08:44:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-20 08:44:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-20 08:44:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-20 08:44:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-20 08:44:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-20 08:44:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-20 08:44:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-20 08:44:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-20 08:44:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-20 08:44:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-20 08:44:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-20 08:44:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-20 08:44:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-20 08:44:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-20 08:44:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-20 08:44:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-20 08:44:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-20 08:44:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-20 08:44:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-20 08:44:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-20 08:44:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-20 08:44:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-20 08:44:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-20 08:44:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-20 08:44:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-20 08:44:09,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-20 08:44:09,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-20 08:44:09,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-20 08:44:09,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-20 08:44:09,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-20 08:44:09,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-20 08:44:09,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-20 08:44:09,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-20 08:44:09,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-20 08:44:09,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-20 08:44:09,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-20 08:44:09,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-20 08:44:09,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-20 08:44:09,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-20 08:44:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-20 08:44:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-20 08:44:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-20 08:44:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-20 08:44:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-20 08:44:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-20 08:44:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:44:09,629 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:44:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:44:09,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:44:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 08:44:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 08:44:09,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-20 08:44:09,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-20 08:44:09,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-20 08:44:09,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-20 08:44:09,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-20 08:44:09,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-20 08:44:09,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-20 08:44:09,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-20 08:44:09,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-20 08:44:09,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-20 08:44:09,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-20 08:44:09,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-20 08:44:09,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-20 08:44:09,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-20 08:44:09,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-20 08:44:09,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-20 08:44:09,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-20 08:44:09,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-20 08:44:09,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-20 08:44:09,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-20 08:44:09,825 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:44:09,827 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:44:10,357 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-20 08:44:10,357 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:44:10,369 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:44:10,370 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:44:10,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:44:10 BoogieIcfgContainer [2024-11-20 08:44:10,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:44:10,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:44:10,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:44:10,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:44:10,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:44:09" (1/3) ... [2024-11-20 08:44:10,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a156061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:44:10, skipping insertion in model container [2024-11-20 08:44:10,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:44:09" (2/3) ... [2024-11-20 08:44:10,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a156061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:44:10, skipping insertion in model container [2024-11-20 08:44:10,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:44:10" (3/3) ... [2024-11-20 08:44:10,378 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-2.i [2024-11-20 08:44:10,390 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:44:10,390 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:44:10,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:44:10,457 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;@68d43c79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:44:10,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:44:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 08:44:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 08:44:10,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:10,470 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:10,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:10,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:10,478 INFO L85 PathProgramCache]: Analyzing trace with hash 630230807, now seen corresponding path program 1 times [2024-11-20 08:44:10,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:10,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996489087] [2024-11-20 08:44:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:10,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:10,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:10,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:10,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 08:44:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:10,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 08:44:10,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:10,812 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-20 08:44:10,813 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:44:10,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:10,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996489087] [2024-11-20 08:44:10,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996489087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:44:10,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:44:10,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:44:10,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719973615] [2024-11-20 08:44:10,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:10,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:44:10,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:10,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:44:10,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:44:10,845 INFO L87 Difference]: Start difference. First operand has 100 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 08:44:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:10,871 INFO L93 Difference]: Finished difference Result 193 states and 302 transitions. [2024-11-20 08:44:10,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:44:10,874 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-20 08:44:10,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:10,879 INFO L225 Difference]: With dead ends: 193 [2024-11-20 08:44:10,879 INFO L226 Difference]: Without dead ends: 96 [2024-11-20 08:44:10,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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-20 08:44:10,885 INFO L432 NwaCegarLoop]: 141 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, 141 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-20 08:44:10,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:44:10,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-20 08:44:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-20 08:44:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 08:44:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions. [2024-11-20 08:44:10,932 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 100 [2024-11-20 08:44:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:10,933 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions. [2024-11-20 08:44:10,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 08:44:10,933 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2024-11-20 08:44:10,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 08:44:10,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:10,937 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:10,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 08:44:11,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:11,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:11,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:11,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1947440875, now seen corresponding path program 1 times [2024-11-20 08:44:11,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:11,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868136168] [2024-11-20 08:44:11,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:11,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:11,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:11,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:11,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 08:44:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:11,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:44:11,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:11,382 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-20 08:44:11,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:44:11,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:11,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868136168] [2024-11-20 08:44:11,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868136168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:44:11,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:44:11,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:44:11,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137629746] [2024-11-20 08:44:11,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:11,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:44:11,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:11,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:44:11,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:44:11,388 INFO L87 Difference]: Start difference. First operand 96 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 08:44:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:11,429 INFO L93 Difference]: Finished difference Result 191 states and 282 transitions. [2024-11-20 08:44:11,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:44:11,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-20 08:44:11,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:11,430 INFO L225 Difference]: With dead ends: 191 [2024-11-20 08:44:11,431 INFO L226 Difference]: Without dead ends: 98 [2024-11-20 08:44:11,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:44:11,432 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:11,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:44:11,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-20 08:44:11,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-20 08:44:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 08:44:11,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2024-11-20 08:44:11,444 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 100 [2024-11-20 08:44:11,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:11,445 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2024-11-20 08:44:11,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 08:44:11,445 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2024-11-20 08:44:11,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 08:44:11,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:11,446 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:11,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 08:44:11,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:11,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:11,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:11,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1503520919, now seen corresponding path program 1 times [2024-11-20 08:44:11,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:11,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506390756] [2024-11-20 08:44:11,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:11,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:11,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:11,654 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:11,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 08:44:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:11,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 08:44:11,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:11,963 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 17 treesize of output 9 [2024-11-20 08:44:11,972 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 17 treesize of output 9 [2024-11-20 08:44:12,329 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:12,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:44:12,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:12,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506390756] [2024-11-20 08:44:12,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506390756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:44:12,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:44:12,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:44:12,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726321973] [2024-11-20 08:44:12,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:12,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:44:12,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:12,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:44:12,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:44:12,331 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:12,501 INFO L93 Difference]: Finished difference Result 289 states and 424 transitions. [2024-11-20 08:44:12,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:44:12,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-11-20 08:44:12,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:12,509 INFO L225 Difference]: With dead ends: 289 [2024-11-20 08:44:12,509 INFO L226 Difference]: Without dead ends: 194 [2024-11-20 08:44:12,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:44:12,510 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 132 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:12,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 387 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:44:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-20 08:44:12,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 162. [2024-11-20 08:44:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 135 states have (on average 1.3925925925925926) internal successors, (188), 135 states have internal predecessors, (188), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 08:44:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 236 transitions. [2024-11-20 08:44:12,538 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 236 transitions. Word has length 100 [2024-11-20 08:44:12,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:12,538 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 236 transitions. [2024-11-20 08:44:12,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 236 transitions. [2024-11-20 08:44:12,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-20 08:44:12,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:12,543 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:12,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 08:44:12,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:12,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:12,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:12,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1823453792, now seen corresponding path program 1 times [2024-11-20 08:44:12,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:12,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529031688] [2024-11-20 08:44:12,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:12,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:12,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:12,748 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:12,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 08:44:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:12,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 08:44:12,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:12,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:44:12,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:12,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529031688] [2024-11-20 08:44:12,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529031688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:44:12,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:44:12,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:44:12,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773951620] [2024-11-20 08:44:12,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:12,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:44:12,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:12,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:44:12,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:44:12,957 INFO L87 Difference]: Start difference. First operand 162 states and 236 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:12,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:12,973 INFO L93 Difference]: Finished difference Result 266 states and 390 transitions. [2024-11-20 08:44:12,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:44:12,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-20 08:44:12,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:12,976 INFO L225 Difference]: With dead ends: 266 [2024-11-20 08:44:12,976 INFO L226 Difference]: Without dead ends: 164 [2024-11-20 08:44:12,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 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-20 08:44:12,977 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 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-20 08:44:12,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:44:12,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-20 08:44:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-20 08:44:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 137 states have (on average 1.3868613138686132) internal successors, (190), 137 states have internal predecessors, (190), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 08:44:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 238 transitions. [2024-11-20 08:44:12,997 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 238 transitions. Word has length 106 [2024-11-20 08:44:12,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:12,998 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 238 transitions. [2024-11-20 08:44:12,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:12,998 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 238 transitions. [2024-11-20 08:44:13,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-20 08:44:13,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:13,001 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:13,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-20 08:44:13,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:13,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:13,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:13,202 INFO L85 PathProgramCache]: Analyzing trace with hash 883165602, now seen corresponding path program 1 times [2024-11-20 08:44:13,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:13,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586677545] [2024-11-20 08:44:13,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:13,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:13,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:13,205 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:13,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 08:44:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:13,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 08:44:13,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:14,130 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 33 treesize of output 21 [2024-11-20 08:44:14,140 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 29 treesize of output 17 [2024-11-20 08:44:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-20 08:44:14,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:14,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:14,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586677545] [2024-11-20 08:44:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586677545] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:14,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:14,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-20 08:44:14,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716554074] [2024-11-20 08:44:14,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:14,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:44:14,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:14,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:44:14,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-20 08:44:14,371 INFO L87 Difference]: Start difference. First operand 164 states and 238 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:14,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:14,600 INFO L93 Difference]: Finished difference Result 305 states and 440 transitions. [2024-11-20 08:44:14,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:44:14,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-20 08:44:14,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:14,602 INFO L225 Difference]: With dead ends: 305 [2024-11-20 08:44:14,602 INFO L226 Difference]: Without dead ends: 209 [2024-11-20 08:44:14,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-20 08:44:14,603 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 56 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:14,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 502 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:44:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-20 08:44:14,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2024-11-20 08:44:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 176 states have (on average 1.3863636363636365) internal successors, (244), 177 states have internal predecessors, (244), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 08:44:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 296 transitions. [2024-11-20 08:44:14,614 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 296 transitions. Word has length 106 [2024-11-20 08:44:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:14,614 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 296 transitions. [2024-11-20 08:44:14,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 296 transitions. [2024-11-20 08:44:14,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-20 08:44:14,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:14,615 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:14,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-20 08:44:14,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:14,816 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:14,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:14,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1584230180, now seen corresponding path program 1 times [2024-11-20 08:44:14,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:14,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980540056] [2024-11-20 08:44:14,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:14,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:14,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:14,819 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:14,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 08:44:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:15,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 08:44:15,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:15,091 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 19 treesize of output 15 [2024-11-20 08:44:15,116 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 24 treesize of output 16 [2024-11-20 08:44:15,131 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 22 treesize of output 14 [2024-11-20 08:44:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:15,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:44:15,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:15,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980540056] [2024-11-20 08:44:15,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980540056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:44:15,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:44:15,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:44:15,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911271173] [2024-11-20 08:44:15,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:15,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:44:15,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:15,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:44:15,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:44:15,176 INFO L87 Difference]: Start difference. First operand 206 states and 296 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:15,627 INFO L93 Difference]: Finished difference Result 454 states and 657 transitions. [2024-11-20 08:44:15,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 08:44:15,627 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-20 08:44:15,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:15,630 INFO L225 Difference]: With dead ends: 454 [2024-11-20 08:44:15,630 INFO L226 Difference]: Without dead ends: 318 [2024-11-20 08:44:15,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-20 08:44:15,631 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 284 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:15,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 745 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:44:15,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-20 08:44:15,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 254. [2024-11-20 08:44:15,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 224 states have (on average 1.40625) internal successors, (315), 225 states have internal predecessors, (315), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 08:44:15,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 367 transitions. [2024-11-20 08:44:15,648 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 367 transitions. Word has length 106 [2024-11-20 08:44:15,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:15,649 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 367 transitions. [2024-11-20 08:44:15,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:15,649 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 367 transitions. [2024-11-20 08:44:15,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 08:44:15,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:15,650 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:15,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 08:44:15,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:15,851 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:15,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:15,851 INFO L85 PathProgramCache]: Analyzing trace with hash 239391488, now seen corresponding path program 1 times [2024-11-20 08:44:15,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:15,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461372795] [2024-11-20 08:44:15,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:15,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:15,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:15,853 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:15,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 08:44:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:16,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 08:44:16,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:16,098 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 24 treesize of output 16 [2024-11-20 08:44:16,117 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 21 treesize of output 13 [2024-11-20 08:44:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:16,141 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:44:16,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:16,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461372795] [2024-11-20 08:44:16,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461372795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:44:16,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:44:16,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:44:16,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486962011] [2024-11-20 08:44:16,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:16,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:44:16,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:16,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:44:16,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:44:16,142 INFO L87 Difference]: Start difference. First operand 254 states and 367 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:16,447 INFO L93 Difference]: Finished difference Result 525 states and 762 transitions. [2024-11-20 08:44:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:44:16,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-20 08:44:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:16,454 INFO L225 Difference]: With dead ends: 525 [2024-11-20 08:44:16,455 INFO L226 Difference]: Without dead ends: 360 [2024-11-20 08:44:16,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:44:16,455 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 71 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:16,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 820 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:44:16,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-20 08:44:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 298. [2024-11-20 08:44:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 268 states have (on average 1.4253731343283582) internal successors, (382), 269 states have internal predecessors, (382), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 08:44:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 434 transitions. [2024-11-20 08:44:16,469 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 434 transitions. Word has length 108 [2024-11-20 08:44:16,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:16,469 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 434 transitions. [2024-11-20 08:44:16,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 434 transitions. [2024-11-20 08:44:16,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 08:44:16,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:16,470 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:16,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-20 08:44:16,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:16,671 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:16,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:16,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1233591454, now seen corresponding path program 1 times [2024-11-20 08:44:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:16,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313174131] [2024-11-20 08:44:16,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:16,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:16,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:16,673 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:16,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-20 08:44:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:16,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 08:44:16,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:17,553 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 37 treesize of output 25 [2024-11-20 08:44:17,556 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 33 treesize of output 21 [2024-11-20 08:44:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-20 08:44:17,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:17,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:17,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313174131] [2024-11-20 08:44:17,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313174131] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:17,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:17,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-20 08:44:17,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593044192] [2024-11-20 08:44:17,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:17,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:44:17,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:17,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:44:17,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-20 08:44:17,751 INFO L87 Difference]: Start difference. First operand 298 states and 434 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:17,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:17,923 INFO L93 Difference]: Finished difference Result 572 states and 829 transitions. [2024-11-20 08:44:17,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:44:17,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-20 08:44:17,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:17,927 INFO L225 Difference]: With dead ends: 572 [2024-11-20 08:44:17,928 INFO L226 Difference]: Without dead ends: 381 [2024-11-20 08:44:17,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-20 08:44:17,929 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 78 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:17,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 601 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:44:17,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-20 08:44:17,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 339. [2024-11-20 08:44:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 308 states have (on average 1.4285714285714286) internal successors, (440), 309 states have internal predecessors, (440), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 08:44:17,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 492 transitions. [2024-11-20 08:44:17,947 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 492 transitions. Word has length 108 [2024-11-20 08:44:17,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:17,948 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 492 transitions. [2024-11-20 08:44:17,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 492 transitions. [2024-11-20 08:44:17,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 08:44:17,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:17,949 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:17,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-20 08:44:18,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:18,150 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:18,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:18,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1656293280, now seen corresponding path program 1 times [2024-11-20 08:44:18,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:18,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476374736] [2024-11-20 08:44:18,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:18,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:18,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:18,152 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:18,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-20 08:44:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:18,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 08:44:18,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:18,398 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 17 [2024-11-20 08:44:18,421 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 22 treesize of output 14 [2024-11-20 08:44:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:18,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:44:18,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:18,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476374736] [2024-11-20 08:44:18,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476374736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:44:18,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:44:18,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:44:18,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648646827] [2024-11-20 08:44:18,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:18,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:44:18,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:18,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:44:18,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:44:18,444 INFO L87 Difference]: Start difference. First operand 339 states and 492 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:18,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:18,792 INFO L93 Difference]: Finished difference Result 696 states and 1017 transitions. [2024-11-20 08:44:18,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:44:18,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-20 08:44:18,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:18,796 INFO L225 Difference]: With dead ends: 696 [2024-11-20 08:44:18,796 INFO L226 Difference]: Without dead ends: 488 [2024-11-20 08:44:18,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:44:18,796 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 70 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:18,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 856 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:44:18,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-20 08:44:18,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 422. [2024-11-20 08:44:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 391 states have (on average 1.4424552429667519) internal successors, (564), 392 states have internal predecessors, (564), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 08:44:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 616 transitions. [2024-11-20 08:44:18,813 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 616 transitions. Word has length 108 [2024-11-20 08:44:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:18,813 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 616 transitions. [2024-11-20 08:44:18,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 616 transitions. [2024-11-20 08:44:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 08:44:18,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:18,815 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:18,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-20 08:44:19,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:19,015 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:19,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:19,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2044829822, now seen corresponding path program 1 times [2024-11-20 08:44:19,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:19,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984010189] [2024-11-20 08:44:19,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:19,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:19,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:19,017 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:19,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-20 08:44:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:19,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-20 08:44:19,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:19,897 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 56 treesize of output 40 [2024-11-20 08:44:19,900 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 48 treesize of output 32 [2024-11-20 08:44:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-20 08:44:19,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:20,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:20,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984010189] [2024-11-20 08:44:20,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984010189] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:20,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:20,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 21 [2024-11-20 08:44:20,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940428963] [2024-11-20 08:44:20,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:20,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:44:20,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:20,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:44:20,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-11-20 08:44:20,114 INFO L87 Difference]: Start difference. First operand 422 states and 616 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:20,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:20,307 INFO L93 Difference]: Finished difference Result 770 states and 1124 transitions. [2024-11-20 08:44:20,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:44:20,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-20 08:44:20,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:20,311 INFO L225 Difference]: With dead ends: 770 [2024-11-20 08:44:20,311 INFO L226 Difference]: Without dead ends: 514 [2024-11-20 08:44:20,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2024-11-20 08:44:20,312 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 238 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:20,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 603 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:44:20,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-20 08:44:20,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 395. [2024-11-20 08:44:20,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 364 states have (on average 1.4423076923076923) internal successors, (525), 365 states have internal predecessors, (525), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 08:44:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 577 transitions. [2024-11-20 08:44:20,324 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 577 transitions. Word has length 108 [2024-11-20 08:44:20,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:20,325 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 577 transitions. [2024-11-20 08:44:20,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:20,325 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 577 transitions. [2024-11-20 08:44:20,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 08:44:20,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:20,326 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:20,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-20 08:44:20,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:20,527 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:20,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:20,528 INFO L85 PathProgramCache]: Analyzing trace with hash 704582421, now seen corresponding path program 1 times [2024-11-20 08:44:20,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:20,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980253655] [2024-11-20 08:44:20,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:20,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:20,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:20,531 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:20,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-20 08:44:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:20,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-20 08:44:20,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:21,232 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 17 treesize of output 13 [2024-11-20 08:44:21,266 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 18 treesize of output 10 [2024-11-20 08:44:21,430 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 54 treesize of output 42 [2024-11-20 08:44:21,432 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 65 treesize of output 41 [2024-11-20 08:44:21,485 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-20 08:44:21,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:21,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:21,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980253655] [2024-11-20 08:44:21,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980253655] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:21,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:21,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 23 [2024-11-20 08:44:21,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430729631] [2024-11-20 08:44:21,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:21,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:44:21,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:21,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:44:21,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2024-11-20 08:44:21,663 INFO L87 Difference]: Start difference. First operand 395 states and 577 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:21,941 INFO L93 Difference]: Finished difference Result 833 states and 1209 transitions. [2024-11-20 08:44:21,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:44:21,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-20 08:44:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:21,943 INFO L225 Difference]: With dead ends: 833 [2024-11-20 08:44:21,943 INFO L226 Difference]: Without dead ends: 586 [2024-11-20 08:44:21,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2024-11-20 08:44:21,944 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 72 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:21,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 827 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:44:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-11-20 08:44:21,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 491. [2024-11-20 08:44:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 460 states have (on average 1.432608695652174) internal successors, (659), 461 states have internal predecessors, (659), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 08:44:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 711 transitions. [2024-11-20 08:44:21,958 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 711 transitions. Word has length 109 [2024-11-20 08:44:21,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:21,958 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 711 transitions. [2024-11-20 08:44:21,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 711 transitions. [2024-11-20 08:44:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 08:44:21,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:21,959 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:21,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-20 08:44:22,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:22,160 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:22,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:22,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1254496272, now seen corresponding path program 1 times [2024-11-20 08:44:22,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:22,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652698247] [2024-11-20 08:44:22,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:22,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:22,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:22,162 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:22,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-20 08:44:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:22,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-20 08:44:22,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:23,081 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 17 treesize of output 13 [2024-11-20 08:44:23,165 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 22 treesize of output 14 [2024-11-20 08:44:23,218 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-20 08:44:23,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:23,506 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:23,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:23,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652698247] [2024-11-20 08:44:23,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652698247] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:23,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:23,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 23 [2024-11-20 08:44:23,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35591405] [2024-11-20 08:44:23,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:23,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:44:23,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:23,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:44:23,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2024-11-20 08:44:23,508 INFO L87 Difference]: Start difference. First operand 491 states and 711 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:24,008 INFO L93 Difference]: Finished difference Result 887 states and 1286 transitions. [2024-11-20 08:44:24,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:44:24,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-20 08:44:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:24,011 INFO L225 Difference]: With dead ends: 887 [2024-11-20 08:44:24,012 INFO L226 Difference]: Without dead ends: 578 [2024-11-20 08:44:24,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2024-11-20 08:44:24,013 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 167 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:24,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 613 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:44:24,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-11-20 08:44:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 512. [2024-11-20 08:44:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 481 states have (on average 1.4303534303534304) internal successors, (688), 482 states have internal predecessors, (688), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 08:44:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 740 transitions. [2024-11-20 08:44:24,025 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 740 transitions. Word has length 109 [2024-11-20 08:44:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:24,026 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 740 transitions. [2024-11-20 08:44:24,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 740 transitions. [2024-11-20 08:44:24,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 08:44:24,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:24,027 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:24,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-20 08:44:24,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:24,231 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:24,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:24,231 INFO L85 PathProgramCache]: Analyzing trace with hash 565754362, now seen corresponding path program 1 times [2024-11-20 08:44:24,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:24,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452021618] [2024-11-20 08:44:24,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:24,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:24,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:24,233 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:24,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-20 08:44:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:24,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 08:44:24,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:24,962 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 27 treesize of output 19 [2024-11-20 08:44:24,967 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-20 08:44:25,008 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 18 treesize of output 10 [2024-11-20 08:44:25,012 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 18 treesize of output 10 [2024-11-20 08:44:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-20 08:44:25,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:25,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:44:25,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2024-11-20 08:44:25,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:25,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452021618] [2024-11-20 08:44:25,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452021618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:25,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1804593278] [2024-11-20 08:44:25,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:25,461 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 08:44:25,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 08:44:25,463 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 08:44:25,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-20 08:44:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:25,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 08:44:25,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:26,254 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 15 treesize of output 1 [2024-11-20 08:44:26,590 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 15 treesize of output 1 [2024-11-20 08:44:27,406 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 17 treesize of output 13 [2024-11-20 08:44:27,409 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 23 treesize of output 15 [2024-11-20 08:44:27,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 18 treesize of output 10 [2024-11-20 08:44:27,469 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 18 treesize of output 10 [2024-11-20 08:44:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-20 08:44:27,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:27,625 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 48 treesize of output 44 [2024-11-20 08:44:27,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1804593278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:27,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:44:27,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-20 08:44:27,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982407486] [2024-11-20 08:44:27,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 08:44:27,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-20 08:44:27,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:27,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-20 08:44:27,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2024-11-20 08:44:27,842 INFO L87 Difference]: Start difference. First operand 512 states and 740 transitions. Second operand has 27 states, 23 states have (on average 4.956521739130435) internal successors, (114), 22 states have internal predecessors, (114), 10 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 6 states have call predecessors, (24), 10 states have call successors, (24) [2024-11-20 08:44:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:29,504 INFO L93 Difference]: Finished difference Result 895 states and 1275 transitions. [2024-11-20 08:44:29,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-20 08:44:29,504 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 4.956521739130435) internal successors, (114), 22 states have internal predecessors, (114), 10 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 6 states have call predecessors, (24), 10 states have call successors, (24) Word has length 109 [2024-11-20 08:44:29,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:29,507 INFO L225 Difference]: With dead ends: 895 [2024-11-20 08:44:29,507 INFO L226 Difference]: Without dead ends: 565 [2024-11-20 08:44:29,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 339 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=656, Invalid=2766, Unknown=0, NotChecked=0, Total=3422 [2024-11-20 08:44:29,509 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 686 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:29,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 1170 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 08:44:29,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-20 08:44:29,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 548. [2024-11-20 08:44:29,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 506 states have (on average 1.3952569169960474) internal successors, (706), 508 states have internal predecessors, (706), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 08:44:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 766 transitions. [2024-11-20 08:44:29,534 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 766 transitions. Word has length 109 [2024-11-20 08:44:29,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:29,534 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 766 transitions. [2024-11-20 08:44:29,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 4.956521739130435) internal successors, (114), 22 states have internal predecessors, (114), 10 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 6 states have call predecessors, (24), 10 states have call successors, (24) [2024-11-20 08:44:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 766 transitions. [2024-11-20 08:44:29,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-20 08:44:29,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:29,535 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:29,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2024-11-20 08:44:29,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-20 08:44:29,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:29,936 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:29,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:29,936 INFO L85 PathProgramCache]: Analyzing trace with hash 772553852, now seen corresponding path program 1 times [2024-11-20 08:44:29,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:29,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118185608] [2024-11-20 08:44:29,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:29,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:29,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:29,938 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:29,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-20 08:44:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:30,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 08:44:30,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:30,263 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 19 treesize of output 15 [2024-11-20 08:44:30,287 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 24 treesize of output 16 [2024-11-20 08:44:30,299 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 22 treesize of output 14 [2024-11-20 08:44:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-20 08:44:30,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:30,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:30,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118185608] [2024-11-20 08:44:30,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118185608] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:30,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:30,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 17 [2024-11-20 08:44:30,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404526536] [2024-11-20 08:44:30,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:30,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 08:44:30,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:30,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 08:44:30,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2024-11-20 08:44:30,486 INFO L87 Difference]: Start difference. First operand 548 states and 766 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:30,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:30,872 INFO L93 Difference]: Finished difference Result 1140 states and 1584 transitions. [2024-11-20 08:44:30,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 08:44:30,873 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-20 08:44:30,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:30,875 INFO L225 Difference]: With dead ends: 1140 [2024-11-20 08:44:30,875 INFO L226 Difference]: Without dead ends: 782 [2024-11-20 08:44:30,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-11-20 08:44:30,878 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 96 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:30,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1613 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:44:30,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-20 08:44:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 618. [2024-11-20 08:44:30,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 576 states have (on average 1.3993055555555556) internal successors, (806), 578 states have internal predecessors, (806), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 08:44:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 866 transitions. [2024-11-20 08:44:30,930 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 866 transitions. Word has length 110 [2024-11-20 08:44:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:30,931 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 866 transitions. [2024-11-20 08:44:30,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 866 transitions. [2024-11-20 08:44:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-20 08:44:30,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:30,932 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:30,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-20 08:44:31,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:31,134 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:31,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:31,134 INFO L85 PathProgramCache]: Analyzing trace with hash 71489274, now seen corresponding path program 1 times [2024-11-20 08:44:31,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:31,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607384090] [2024-11-20 08:44:31,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:31,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:31,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:31,137 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:31,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-20 08:44:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:31,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 08:44:31,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:31,873 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 33 treesize of output 21 [2024-11-20 08:44:31,875 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 29 treesize of output 17 [2024-11-20 08:44:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-20 08:44:31,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:32,035 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:32,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:32,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607384090] [2024-11-20 08:44:32,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607384090] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:32,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:32,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-20 08:44:32,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721351174] [2024-11-20 08:44:32,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:32,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:44:32,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:32,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:44:32,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-20 08:44:32,037 INFO L87 Difference]: Start difference. First operand 618 states and 866 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:32,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:32,235 INFO L93 Difference]: Finished difference Result 1110 states and 1560 transitions. [2024-11-20 08:44:32,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:44:32,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-20 08:44:32,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:32,240 INFO L225 Difference]: With dead ends: 1110 [2024-11-20 08:44:32,240 INFO L226 Difference]: Without dead ends: 712 [2024-11-20 08:44:32,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-20 08:44:32,241 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 53 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:32,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 508 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:44:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-11-20 08:44:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 626. [2024-11-20 08:44:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 584 states have (on average 1.3972602739726028) internal successors, (816), 586 states have internal predecessors, (816), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 08:44:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 876 transitions. [2024-11-20 08:44:32,276 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 876 transitions. Word has length 110 [2024-11-20 08:44:32,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:32,276 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 876 transitions. [2024-11-20 08:44:32,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:32,276 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 876 transitions. [2024-11-20 08:44:32,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 08:44:32,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:32,277 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:32,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-20 08:44:32,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:32,478 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:32,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:32,479 INFO L85 PathProgramCache]: Analyzing trace with hash -616335168, now seen corresponding path program 1 times [2024-11-20 08:44:32,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:32,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352206977] [2024-11-20 08:44:32,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:32,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:32,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:32,480 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:32,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-20 08:44:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:32,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-20 08:44:32,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:33,202 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 15 treesize of output 1 [2024-11-20 08:44:33,316 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 128 treesize of output 92 [2024-11-20 08:44:33,317 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 140 treesize of output 80 [2024-11-20 08:44:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-20 08:44:33,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:33,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:33,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352206977] [2024-11-20 08:44:33,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352206977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:33,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1704374523] [2024-11-20 08:44:33,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:33,526 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 08:44:33,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 08:44:33,528 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 08:44:33,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-20 08:44:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:34,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-20 08:44:34,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:34,668 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 15 treesize of output 1 [2024-11-20 08:44:35,089 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 15 treesize of output 1 [2024-11-20 08:44:35,275 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 128 treesize of output 92 [2024-11-20 08:44:35,277 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 140 treesize of output 80 [2024-11-20 08:44:35,289 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-20 08:44:35,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:35,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1704374523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:35,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:44:35,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2024-11-20 08:44:35,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865875803] [2024-11-20 08:44:35,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 08:44:35,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 08:44:35,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:35,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 08:44:35,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2024-11-20 08:44:35,382 INFO L87 Difference]: Start difference. First operand 626 states and 876 transitions. Second operand has 18 states, 18 states have (on average 6.055555555555555) internal successors, (109), 17 states have internal predecessors, (109), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-20 08:44:36,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:36,333 INFO L93 Difference]: Finished difference Result 1418 states and 1973 transitions. [2024-11-20 08:44:36,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 08:44:36,333 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.055555555555555) internal successors, (109), 17 states have internal predecessors, (109), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 111 [2024-11-20 08:44:36,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:36,337 INFO L225 Difference]: With dead ends: 1418 [2024-11-20 08:44:36,337 INFO L226 Difference]: Without dead ends: 1416 [2024-11-20 08:44:36,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2024-11-20 08:44:36,338 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 662 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:36,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1449 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 08:44:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2024-11-20 08:44:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1410. [2024-11-20 08:44:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1317 states have (on average 1.3917995444191344) internal successors, (1833), 1325 states have internal predecessors, (1833), 66 states have call successors, (66), 26 states have call predecessors, (66), 26 states have return successors, (66), 58 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 08:44:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 1965 transitions. [2024-11-20 08:44:36,408 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 1965 transitions. Word has length 111 [2024-11-20 08:44:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:36,409 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 1965 transitions. [2024-11-20 08:44:36,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.055555555555555) internal successors, (109), 17 states have internal predecessors, (109), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-20 08:44:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1965 transitions. [2024-11-20 08:44:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 08:44:36,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:36,410 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:36,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2024-11-20 08:44:36,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-20 08:44:36,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:36,811 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:36,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:36,811 INFO L85 PathProgramCache]: Analyzing trace with hash -446399275, now seen corresponding path program 1 times [2024-11-20 08:44:36,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:36,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593676955] [2024-11-20 08:44:36,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:36,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:36,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:36,813 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:36,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-20 08:44:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:37,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-20 08:44:37,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:37,478 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 35 treesize of output 27 [2024-11-20 08:44:37,616 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 29 treesize of output 17 [2024-11-20 08:44:37,912 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 40 treesize of output 32 [2024-11-20 08:44:37,914 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 32 treesize of output 24 [2024-11-20 08:44:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-20 08:44:37,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:38,231 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 41 treesize of output 33 [2024-11-20 08:44:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:38,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:38,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593676955] [2024-11-20 08:44:38,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593676955] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:38,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:38,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2024-11-20 08:44:38,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872396151] [2024-11-20 08:44:38,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:38,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:44:38,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:38,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:44:38,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-11-20 08:44:38,266 INFO L87 Difference]: Start difference. First operand 1410 states and 1965 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:38,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:38,712 INFO L93 Difference]: Finished difference Result 2650 states and 3705 transitions. [2024-11-20 08:44:38,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:44:38,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-20 08:44:38,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:38,718 INFO L225 Difference]: With dead ends: 2650 [2024-11-20 08:44:38,718 INFO L226 Difference]: Without dead ends: 1648 [2024-11-20 08:44:38,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2024-11-20 08:44:38,722 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 173 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:38,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 555 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:44:38,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2024-11-20 08:44:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1407. [2024-11-20 08:44:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1314 states have (on average 1.3904109589041096) internal successors, (1827), 1322 states have internal predecessors, (1827), 66 states have call successors, (66), 26 states have call predecessors, (66), 26 states have return successors, (66), 58 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 08:44:38,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1959 transitions. [2024-11-20 08:44:38,806 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1959 transitions. Word has length 111 [2024-11-20 08:44:38,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:38,807 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 1959 transitions. [2024-11-20 08:44:38,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1959 transitions. [2024-11-20 08:44:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 08:44:38,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:38,808 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:38,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-20 08:44:39,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:39,009 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:39,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:39,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2093625983, now seen corresponding path program 1 times [2024-11-20 08:44:39,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:39,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998966471] [2024-11-20 08:44:39,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:39,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:39,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:39,013 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:39,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-20 08:44:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:39,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 08:44:39,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:39,833 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-20 08:44:39,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:40,073 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:40,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:40,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998966471] [2024-11-20 08:44:40,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998966471] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:40,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:40,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2024-11-20 08:44:40,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366198920] [2024-11-20 08:44:40,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:40,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:44:40,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:40,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:44:40,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-11-20 08:44:40,075 INFO L87 Difference]: Start difference. First operand 1407 states and 1959 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:40,498 INFO L93 Difference]: Finished difference Result 2880 states and 4000 transitions. [2024-11-20 08:44:40,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:44:40,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-20 08:44:40,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:40,504 INFO L225 Difference]: With dead ends: 2880 [2024-11-20 08:44:40,504 INFO L226 Difference]: Without dead ends: 1867 [2024-11-20 08:44:40,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2024-11-20 08:44:40,506 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 245 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:40,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 665 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:44:40,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2024-11-20 08:44:40,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1366. [2024-11-20 08:44:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1273 states have (on average 1.3935585231736056) internal successors, (1774), 1281 states have internal predecessors, (1774), 66 states have call successors, (66), 26 states have call predecessors, (66), 26 states have return successors, (66), 58 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 08:44:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1906 transitions. [2024-11-20 08:44:40,585 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1906 transitions. Word has length 111 [2024-11-20 08:44:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:40,585 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 1906 transitions. [2024-11-20 08:44:40,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1906 transitions. [2024-11-20 08:44:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 08:44:40,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:40,586 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:40,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-20 08:44:40,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:40,787 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:40,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:40,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1959612477, now seen corresponding path program 1 times [2024-11-20 08:44:40,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:40,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833010656] [2024-11-20 08:44:40,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:40,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:40,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:40,789 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:40,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-20 08:44:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:41,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 08:44:41,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:41,508 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 34 treesize of output 22 [2024-11-20 08:44:41,511 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 21 treesize of output 13 [2024-11-20 08:44:41,553 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 39 treesize of output 31 [2024-11-20 08:44:41,555 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 31 treesize of output 23 [2024-11-20 08:44:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-20 08:44:41,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:41,833 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 36 treesize of output 28 [2024-11-20 08:44:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:41,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:41,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833010656] [2024-11-20 08:44:41,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833010656] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:41,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:41,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2024-11-20 08:44:41,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652278434] [2024-11-20 08:44:41,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:41,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:44:41,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:41,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:44:41,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-11-20 08:44:41,923 INFO L87 Difference]: Start difference. First operand 1366 states and 1906 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:42,502 INFO L93 Difference]: Finished difference Result 2562 states and 3588 transitions. [2024-11-20 08:44:42,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:44:42,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-20 08:44:42,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:42,507 INFO L225 Difference]: With dead ends: 2562 [2024-11-20 08:44:42,508 INFO L226 Difference]: Without dead ends: 1588 [2024-11-20 08:44:42,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2024-11-20 08:44:42,509 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 135 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:42,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 744 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:44:42,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2024-11-20 08:44:42,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1366. [2024-11-20 08:44:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1273 states have (on average 1.3935585231736056) internal successors, (1774), 1281 states have internal predecessors, (1774), 66 states have call successors, (66), 26 states have call predecessors, (66), 26 states have return successors, (66), 58 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 08:44:42,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1906 transitions. [2024-11-20 08:44:42,574 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1906 transitions. Word has length 111 [2024-11-20 08:44:42,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:42,574 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 1906 transitions. [2024-11-20 08:44:42,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:42,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1906 transitions. [2024-11-20 08:44:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 08:44:42,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:42,579 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:42,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-20 08:44:42,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:42,780 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:42,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:42,781 INFO L85 PathProgramCache]: Analyzing trace with hash -508438889, now seen corresponding path program 1 times [2024-11-20 08:44:42,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:42,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390212884] [2024-11-20 08:44:42,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:42,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:42,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:42,782 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:42,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-20 08:44:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:42,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-20 08:44:43,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:43,296 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 33 treesize of output 25 [2024-11-20 08:44:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-20 08:44:43,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:43,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:43,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390212884] [2024-11-20 08:44:43,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390212884] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:43,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:43,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-20 08:44:43,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518113432] [2024-11-20 08:44:43,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:43,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:44:43,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:43,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:44:43,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:44:43,519 INFO L87 Difference]: Start difference. First operand 1366 states and 1906 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:43,846 INFO L93 Difference]: Finished difference Result 2578 states and 3637 transitions. [2024-11-20 08:44:43,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:44:43,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-20 08:44:43,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:43,852 INFO L225 Difference]: With dead ends: 2578 [2024-11-20 08:44:43,852 INFO L226 Difference]: Without dead ends: 1604 [2024-11-20 08:44:43,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-20 08:44:43,854 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 78 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:43,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 524 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:44:43,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2024-11-20 08:44:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1392. [2024-11-20 08:44:43,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1299 states have (on average 1.3956889915319477) internal successors, (1813), 1307 states have internal predecessors, (1813), 66 states have call successors, (66), 26 states have call predecessors, (66), 26 states have return successors, (66), 58 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 08:44:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1945 transitions. [2024-11-20 08:44:43,914 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1945 transitions. Word has length 111 [2024-11-20 08:44:43,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:43,914 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1945 transitions. [2024-11-20 08:44:43,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:43,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1945 transitions. [2024-11-20 08:44:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 08:44:43,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:43,916 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:43,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-20 08:44:44,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:44,117 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:44,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:44,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1209503467, now seen corresponding path program 1 times [2024-11-20 08:44:44,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:44,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657481428] [2024-11-20 08:44:44,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:44,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:44,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:44,119 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:44,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-20 08:44:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:44,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-20 08:44:44,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:44,931 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 42 treesize of output 30 [2024-11-20 08:44:44,976 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 58 treesize of output 46 [2024-11-20 08:44:44,978 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 46 treesize of output 34 [2024-11-20 08:44:45,027 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-20 08:44:45,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:45,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:45,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657481428] [2024-11-20 08:44:45,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657481428] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:45,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:45,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2024-11-20 08:44:45,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382200260] [2024-11-20 08:44:45,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:45,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:44:45,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:45,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:44:45,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-11-20 08:44:45,286 INFO L87 Difference]: Start difference. First operand 1392 states and 1945 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:45,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:45,732 INFO L93 Difference]: Finished difference Result 2564 states and 3594 transitions. [2024-11-20 08:44:45,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:44:45,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-20 08:44:45,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:45,737 INFO L225 Difference]: With dead ends: 2564 [2024-11-20 08:44:45,737 INFO L226 Difference]: Without dead ends: 1564 [2024-11-20 08:44:45,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2024-11-20 08:44:45,739 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 188 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:45,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 717 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:44:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2024-11-20 08:44:45,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1387. [2024-11-20 08:44:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1387 states, 1294 states have (on average 1.3933539412673879) internal successors, (1803), 1302 states have internal predecessors, (1803), 66 states have call successors, (66), 26 states have call predecessors, (66), 26 states have return successors, (66), 58 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 08:44:45,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 1935 transitions. [2024-11-20 08:44:45,809 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 1935 transitions. Word has length 111 [2024-11-20 08:44:45,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:45,810 INFO L471 AbstractCegarLoop]: Abstraction has 1387 states and 1935 transitions. [2024-11-20 08:44:45,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:45,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1935 transitions. [2024-11-20 08:44:45,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 08:44:45,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:45,811 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:45,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-20 08:44:46,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:46,012 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:46,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:46,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1095244903, now seen corresponding path program 1 times [2024-11-20 08:44:46,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:46,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059444638] [2024-11-20 08:44:46,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:46,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:46,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:46,014 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:46,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-20 08:44:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:46,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 08:44:46,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:46,449 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 33 treesize of output 25 [2024-11-20 08:44:46,451 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 29 treesize of output 21 [2024-11-20 08:44:46,453 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 17 [2024-11-20 08:44:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-20 08:44:46,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:46,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:46,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059444638] [2024-11-20 08:44:46,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059444638] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:46,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:46,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-20 08:44:46,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872577064] [2024-11-20 08:44:46,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:46,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:44:46,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:46,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:44:46,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:44:46,623 INFO L87 Difference]: Start difference. First operand 1387 states and 1935 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:46,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:46,868 INFO L93 Difference]: Finished difference Result 2625 states and 3665 transitions. [2024-11-20 08:44:46,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:44:46,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-20 08:44:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:46,874 INFO L225 Difference]: With dead ends: 2625 [2024-11-20 08:44:46,874 INFO L226 Difference]: Without dead ends: 1630 [2024-11-20 08:44:46,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:44:46,876 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 142 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:46,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 471 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:44:46,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2024-11-20 08:44:46,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1282. [2024-11-20 08:44:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1189 states have (on average 1.3877207737594617) internal successors, (1650), 1197 states have internal predecessors, (1650), 66 states have call successors, (66), 26 states have call predecessors, (66), 26 states have return successors, (66), 58 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 08:44:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1782 transitions. [2024-11-20 08:44:46,935 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1782 transitions. Word has length 111 [2024-11-20 08:44:46,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:46,936 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1782 transitions. [2024-11-20 08:44:46,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1782 transitions. [2024-11-20 08:44:46,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 08:44:46,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:46,937 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:46,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-20 08:44:47,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:47,138 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:47,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:47,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1796309481, now seen corresponding path program 1 times [2024-11-20 08:44:47,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:47,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546086645] [2024-11-20 08:44:47,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:47,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:47,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:47,140 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:47,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-20 08:44:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:47,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-20 08:44:47,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:47,825 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 43 treesize of output 35 [2024-11-20 08:44:47,828 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 35 treesize of output 27 [2024-11-20 08:44:48,012 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 34 treesize of output 22 [2024-11-20 08:44:48,316 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 26 treesize of output 18 [2024-11-20 08:44:48,401 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-20 08:44:48,401 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:48,639 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 41 treesize of output 33 [2024-11-20 08:44:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:48,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:48,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546086645] [2024-11-20 08:44:48,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546086645] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:48,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:48,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2024-11-20 08:44:48,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508470094] [2024-11-20 08:44:48,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:48,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:44:48,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:48,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:44:48,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-11-20 08:44:48,681 INFO L87 Difference]: Start difference. First operand 1282 states and 1782 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:49,182 INFO L93 Difference]: Finished difference Result 2376 states and 3308 transitions. [2024-11-20 08:44:49,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:44:49,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-20 08:44:49,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:49,186 INFO L225 Difference]: With dead ends: 2376 [2024-11-20 08:44:49,186 INFO L226 Difference]: Without dead ends: 1434 [2024-11-20 08:44:49,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2024-11-20 08:44:49,188 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 60 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:49,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 868 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:44:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2024-11-20 08:44:49,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1228. [2024-11-20 08:44:49,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1135 states have (on average 1.3823788546255507) internal successors, (1569), 1143 states have internal predecessors, (1569), 66 states have call successors, (66), 26 states have call predecessors, (66), 26 states have return successors, (66), 58 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 08:44:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1701 transitions. [2024-11-20 08:44:49,249 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1701 transitions. Word has length 111 [2024-11-20 08:44:49,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:49,250 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1701 transitions. [2024-11-20 08:44:49,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:49,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1701 transitions. [2024-11-20 08:44:49,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 08:44:49,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:49,251 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:49,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-11-20 08:44:49,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:49,452 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:49,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:49,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2031586369, now seen corresponding path program 1 times [2024-11-20 08:44:49,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:49,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809666125] [2024-11-20 08:44:49,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:49,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:49,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:49,454 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:49,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-20 08:44:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:49,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-20 08:44:49,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:50,614 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 28 treesize of output 24 [2024-11-20 08:44:50,944 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 24 treesize of output 20 [2024-11-20 08:44:51,053 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 91 treesize of output 71 [2024-11-20 08:44:51,056 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 75 treesize of output 55 [2024-11-20 08:44:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-20 08:44:51,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:51,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:51,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809666125] [2024-11-20 08:44:51,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809666125] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:51,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:51,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [20] total 27 [2024-11-20 08:44:51,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81969682] [2024-11-20 08:44:51,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:51,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:44:51,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:51,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:44:51,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2024-11-20 08:44:51,525 INFO L87 Difference]: Start difference. First operand 1228 states and 1701 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:52,161 INFO L93 Difference]: Finished difference Result 2424 states and 3369 transitions. [2024-11-20 08:44:52,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:44:52,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-20 08:44:52,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:52,166 INFO L225 Difference]: With dead ends: 2424 [2024-11-20 08:44:52,166 INFO L226 Difference]: Without dead ends: 1514 [2024-11-20 08:44:52,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2024-11-20 08:44:52,167 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 195 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:52,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 811 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:44:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-20 08:44:52,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1337. [2024-11-20 08:44:52,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 1244 states have (on average 1.3858520900321543) internal successors, (1724), 1252 states have internal predecessors, (1724), 66 states have call successors, (66), 26 states have call predecessors, (66), 26 states have return successors, (66), 58 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 08:44:52,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1856 transitions. [2024-11-20 08:44:52,228 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1856 transitions. Word has length 111 [2024-11-20 08:44:52,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:52,229 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 1856 transitions. [2024-11-20 08:44:52,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:52,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1856 transitions. [2024-11-20 08:44:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 08:44:52,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:52,230 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:52,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-20 08:44:52,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:52,431 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:52,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:52,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1562316349, now seen corresponding path program 1 times [2024-11-20 08:44:52,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:52,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925194177] [2024-11-20 08:44:52,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:52,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:52,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:52,433 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:52,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-20 08:44:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:52,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 08:44:52,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:52,927 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 33 treesize of output 25 [2024-11-20 08:44:52,943 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 29 treesize of output 21 [2024-11-20 08:44:52,946 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 17 [2024-11-20 08:44:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-20 08:44:52,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:53,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:53,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925194177] [2024-11-20 08:44:53,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925194177] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:53,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:53,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-20 08:44:53,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233163380] [2024-11-20 08:44:53,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:53,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:44:53,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:53,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:44:53,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:44:53,146 INFO L87 Difference]: Start difference. First operand 1337 states and 1856 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:53,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:53,499 INFO L93 Difference]: Finished difference Result 2510 states and 3475 transitions. [2024-11-20 08:44:53,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:44:53,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-20 08:44:53,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:53,505 INFO L225 Difference]: With dead ends: 2510 [2024-11-20 08:44:53,505 INFO L226 Difference]: Without dead ends: 1543 [2024-11-20 08:44:53,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:44:53,507 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 134 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:53,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 474 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:44:53,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2024-11-20 08:44:53,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1272. [2024-11-20 08:44:53,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1179 states have (on average 1.374893977947413) internal successors, (1621), 1187 states have internal predecessors, (1621), 66 states have call successors, (66), 26 states have call predecessors, (66), 26 states have return successors, (66), 58 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 08:44:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1753 transitions. [2024-11-20 08:44:53,575 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1753 transitions. Word has length 111 [2024-11-20 08:44:53,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:53,575 INFO L471 AbstractCegarLoop]: Abstraction has 1272 states and 1753 transitions. [2024-11-20 08:44:53,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1753 transitions. [2024-11-20 08:44:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 08:44:53,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:53,593 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:53,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2024-11-20 08:44:53,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:53,793 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:53,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:53,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1897572863, now seen corresponding path program 1 times [2024-11-20 08:44:53,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:53,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254295533] [2024-11-20 08:44:53,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:53,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:53,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:53,795 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:53,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-20 08:44:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:54,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 08:44:54,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:54,277 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 33 treesize of output 25 [2024-11-20 08:44:54,280 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 29 treesize of output 21 [2024-11-20 08:44:54,282 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 17 [2024-11-20 08:44:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-20 08:44:54,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:54,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:54,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254295533] [2024-11-20 08:44:54,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254295533] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:54,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:54,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-20 08:44:54,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361605307] [2024-11-20 08:44:54,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:54,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:44:54,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:54,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:44:54,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:44:54,439 INFO L87 Difference]: Start difference. First operand 1272 states and 1753 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:54,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:54,815 INFO L93 Difference]: Finished difference Result 2472 states and 3394 transitions. [2024-11-20 08:44:54,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:44:54,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-20 08:44:54,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:54,821 INFO L225 Difference]: With dead ends: 2472 [2024-11-20 08:44:54,821 INFO L226 Difference]: Without dead ends: 1490 [2024-11-20 08:44:54,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:44:54,823 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 85 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:54,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 589 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:44:54,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2024-11-20 08:44:54,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1160. [2024-11-20 08:44:54,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1067 states have (on average 1.3645735707591378) internal successors, (1456), 1075 states have internal predecessors, (1456), 66 states have call successors, (66), 26 states have call predecessors, (66), 26 states have return successors, (66), 58 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 08:44:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1588 transitions. [2024-11-20 08:44:54,898 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1588 transitions. Word has length 111 [2024-11-20 08:44:54,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:54,898 INFO L471 AbstractCegarLoop]: Abstraction has 1160 states and 1588 transitions. [2024-11-20 08:44:54,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1588 transitions. [2024-11-20 08:44:54,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-20 08:44:54,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:54,899 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:54,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2024-11-20 08:44:55,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:55,101 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:55,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:55,101 INFO L85 PathProgramCache]: Analyzing trace with hash 597272345, now seen corresponding path program 1 times [2024-11-20 08:44:55,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:55,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404265226] [2024-11-20 08:44:55,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:55,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:55,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:55,102 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:55,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-20 08:44:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:55,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 08:44:55,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 2 proven. 114 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-20 08:44:55,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:55,752 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:55,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:55,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404265226] [2024-11-20 08:44:55,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404265226] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:55,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:55,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-20 08:44:55,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511724600] [2024-11-20 08:44:55,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:55,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:44:55,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:55,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:44:55,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:44:55,753 INFO L87 Difference]: Start difference. First operand 1160 states and 1588 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:55,916 INFO L93 Difference]: Finished difference Result 2631 states and 3633 transitions. [2024-11-20 08:44:55,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:44:55,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-11-20 08:44:55,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:55,922 INFO L225 Difference]: With dead ends: 2631 [2024-11-20 08:44:55,922 INFO L226 Difference]: Without dead ends: 1761 [2024-11-20 08:44:55,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:44:55,924 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 82 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:55,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 617 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:44:55,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2024-11-20 08:44:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1756. [2024-11-20 08:44:56,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1620 states have (on average 1.3703703703703705) internal successors, (2220), 1634 states have internal predecessors, (2220), 96 states have call successors, (96), 39 states have call predecessors, (96), 39 states have return successors, (96), 82 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-20 08:44:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2412 transitions. [2024-11-20 08:44:56,011 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2412 transitions. Word has length 112 [2024-11-20 08:44:56,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:56,011 INFO L471 AbstractCegarLoop]: Abstraction has 1756 states and 2412 transitions. [2024-11-20 08:44:56,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2412 transitions. [2024-11-20 08:44:56,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-20 08:44:56,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:56,013 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:56,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2024-11-20 08:44:56,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:56,213 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:56,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:56,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1208165989, now seen corresponding path program 1 times [2024-11-20 08:44:56,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:56,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561223147] [2024-11-20 08:44:56,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:56,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:56,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:56,215 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:56,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-11-20 08:44:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:56,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-20 08:44:56,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:57,089 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 18 treesize of output 10 [2024-11-20 08:44:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-20 08:44:57,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:44:57,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:57,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561223147] [2024-11-20 08:44:57,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561223147] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:44:57,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:44:57,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 22 [2024-11-20 08:44:57,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196192749] [2024-11-20 08:44:57,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:44:57,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:44:57,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:57,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:44:57,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2024-11-20 08:44:57,442 INFO L87 Difference]: Start difference. First operand 1756 states and 2412 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:57,860 INFO L93 Difference]: Finished difference Result 3220 states and 4404 transitions. [2024-11-20 08:44:57,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:44:57,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-11-20 08:44:57,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:57,866 INFO L225 Difference]: With dead ends: 3220 [2024-11-20 08:44:57,866 INFO L226 Difference]: Without dead ends: 1860 [2024-11-20 08:44:57,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2024-11-20 08:44:57,868 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 139 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:57,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 842 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:44:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2024-11-20 08:44:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1667. [2024-11-20 08:44:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1537 states have (on average 1.369551073519844) internal successors, (2105), 1548 states have internal predecessors, (2105), 90 states have call successors, (90), 39 states have call predecessors, (90), 39 states have return successors, (90), 79 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-20 08:44:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2285 transitions. [2024-11-20 08:44:57,965 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2285 transitions. Word has length 112 [2024-11-20 08:44:57,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:57,965 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2285 transitions. [2024-11-20 08:44:57,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:44:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2285 transitions. [2024-11-20 08:44:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 08:44:57,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:57,967 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:57,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2024-11-20 08:44:58,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:58,168 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:58,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:58,168 INFO L85 PathProgramCache]: Analyzing trace with hash -951262728, now seen corresponding path program 1 times [2024-11-20 08:44:58,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:58,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735529251] [2024-11-20 08:44:58,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:58,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:58,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:58,170 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:58,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2024-11-20 08:44:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:58,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 08:44:58,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:44:58,525 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 79 treesize of output 43 [2024-11-20 08:44:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 44 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-20 08:44:58,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:44:58,657 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 49 treesize of output 25 [2024-11-20 08:44:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-20 08:44:58,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:44:58,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735529251] [2024-11-20 08:44:58,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735529251] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 08:44:58,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:44:58,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-20 08:44:58,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454262434] [2024-11-20 08:44:58,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 08:44:58,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 08:44:58,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:44:58,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 08:44:58,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:44:58,694 INFO L87 Difference]: Start difference. First operand 1667 states and 2285 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-20 08:44:59,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:44:59,224 INFO L93 Difference]: Finished difference Result 3173 states and 4333 transitions. [2024-11-20 08:44:59,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 08:44:59,226 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 113 [2024-11-20 08:44:59,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:44:59,231 INFO L225 Difference]: With dead ends: 3173 [2024-11-20 08:44:59,231 INFO L226 Difference]: Without dead ends: 1713 [2024-11-20 08:44:59,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-20 08:44:59,234 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 111 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:44:59,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 845 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:44:59,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2024-11-20 08:44:59,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1663. [2024-11-20 08:44:59,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1533 states have (on average 1.3679060665362035) internal successors, (2097), 1544 states have internal predecessors, (2097), 90 states have call successors, (90), 39 states have call predecessors, (90), 39 states have return successors, (90), 79 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-20 08:44:59,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2277 transitions. [2024-11-20 08:44:59,348 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2277 transitions. Word has length 113 [2024-11-20 08:44:59,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:44:59,348 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 2277 transitions. [2024-11-20 08:44:59,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-20 08:44:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2277 transitions. [2024-11-20 08:44:59,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 08:44:59,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:44:59,349 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:44:59,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2024-11-20 08:44:59,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:59,550 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:44:59,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:44:59,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1322422222, now seen corresponding path program 1 times [2024-11-20 08:44:59,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:44:59,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419714848] [2024-11-20 08:44:59,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:44:59,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:44:59,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:44:59,552 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:44:59,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2024-11-20 08:44:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:44:59,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 08:44:59,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:45:00,489 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 33 treesize of output 21 [2024-11-20 08:45:00,491 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 29 treesize of output 17 [2024-11-20 08:45:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-20 08:45:00,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:45:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:45:00,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:45:00,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419714848] [2024-11-20 08:45:00,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419714848] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:45:00,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:45:00,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-20 08:45:00,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286911962] [2024-11-20 08:45:00,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:45:00,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:45:00,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:45:00,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:45:00,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-20 08:45:00,655 INFO L87 Difference]: Start difference. First operand 1663 states and 2277 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:45:00,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:45:00,888 INFO L93 Difference]: Finished difference Result 3104 states and 4227 transitions. [2024-11-20 08:45:00,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:45:00,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-20 08:45:00,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:45:00,896 INFO L225 Difference]: With dead ends: 3104 [2024-11-20 08:45:00,897 INFO L226 Difference]: Without dead ends: 1835 [2024-11-20 08:45:00,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-20 08:45:00,899 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 72 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:45:00,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 387 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:45:00,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2024-11-20 08:45:00,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1752. [2024-11-20 08:45:00,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1622 states have (on average 1.3643649815043157) internal successors, (2213), 1633 states have internal predecessors, (2213), 90 states have call successors, (90), 39 states have call predecessors, (90), 39 states have return successors, (90), 79 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-20 08:45:00,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2393 transitions. [2024-11-20 08:45:00,996 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2393 transitions. Word has length 113 [2024-11-20 08:45:00,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:45:00,996 INFO L471 AbstractCegarLoop]: Abstraction has 1752 states and 2393 transitions. [2024-11-20 08:45:00,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:45:00,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2393 transitions. [2024-11-20 08:45:00,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 08:45:00,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:45:00,998 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:45:01,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2024-11-20 08:45:01,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:45:01,198 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:45:01,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:45:01,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1961952436, now seen corresponding path program 1 times [2024-11-20 08:45:01,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:45:01,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072542991] [2024-11-20 08:45:01,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:45:01,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:45:01,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:45:01,200 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:45:01,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2024-11-20 08:45:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:45:01,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-20 08:45:01,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:45:02,086 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 18 treesize of output 10 [2024-11-20 08:45:02,255 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-20 08:45:02,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:45:02,425 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:45:02,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:45:02,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072542991] [2024-11-20 08:45:02,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072542991] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:45:02,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:45:02,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 22 [2024-11-20 08:45:02,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875341769] [2024-11-20 08:45:02,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:45:02,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:45:02,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:45:02,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:45:02,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2024-11-20 08:45:02,426 INFO L87 Difference]: Start difference. First operand 1752 states and 2393 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:45:02,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:45:02,764 INFO L93 Difference]: Finished difference Result 3129 states and 4264 transitions. [2024-11-20 08:45:02,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:45:02,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-20 08:45:02,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:45:02,768 INFO L225 Difference]: With dead ends: 3129 [2024-11-20 08:45:02,771 INFO L226 Difference]: Without dead ends: 1771 [2024-11-20 08:45:02,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2024-11-20 08:45:02,773 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 168 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:45:02,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 616 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:45:02,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2024-11-20 08:45:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1752. [2024-11-20 08:45:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1622 states have (on average 1.3631319358816276) internal successors, (2211), 1633 states have internal predecessors, (2211), 90 states have call successors, (90), 39 states have call predecessors, (90), 39 states have return successors, (90), 79 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-20 08:45:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2391 transitions. [2024-11-20 08:45:02,864 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2391 transitions. Word has length 113 [2024-11-20 08:45:02,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:45:02,865 INFO L471 AbstractCegarLoop]: Abstraction has 1752 states and 2391 transitions. [2024-11-20 08:45:02,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:45:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2391 transitions. [2024-11-20 08:45:02,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 08:45:02,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:45:02,866 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:45:02,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2024-11-20 08:45:03,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:45:03,069 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:45:03,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:45:03,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1375146422, now seen corresponding path program 1 times [2024-11-20 08:45:03,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:45:03,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671806824] [2024-11-20 08:45:03,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:45:03,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:45:03,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:45:03,073 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:45:03,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2024-11-20 08:45:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:45:03,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 08:45:03,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:45:03,665 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 2 proven. 114 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-20 08:45:03,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:45:03,746 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:45:03,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:45:03,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671806824] [2024-11-20 08:45:03,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671806824] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:45:03,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:45:03,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-20 08:45:03,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582897864] [2024-11-20 08:45:03,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:45:03,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:45:03,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:45:03,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:45:03,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:45:03,747 INFO L87 Difference]: Start difference. First operand 1752 states and 2391 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:45:03,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:45:03,887 INFO L93 Difference]: Finished difference Result 3104 states and 4223 transitions. [2024-11-20 08:45:03,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:45:03,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-20 08:45:03,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:45:03,891 INFO L225 Difference]: With dead ends: 3104 [2024-11-20 08:45:03,891 INFO L226 Difference]: Without dead ends: 1746 [2024-11-20 08:45:03,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:45:03,893 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 86 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:45:03,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 609 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:45:03,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2024-11-20 08:45:03,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1741. [2024-11-20 08:45:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1741 states, 1608 states have (on average 1.355721393034826) internal successors, (2180), 1619 states have internal predecessors, (2180), 90 states have call successors, (90), 42 states have call predecessors, (90), 42 states have return successors, (90), 79 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-20 08:45:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2360 transitions. [2024-11-20 08:45:03,998 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2360 transitions. Word has length 113 [2024-11-20 08:45:03,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:45:03,998 INFO L471 AbstractCegarLoop]: Abstraction has 1741 states and 2360 transitions. [2024-11-20 08:45:03,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:45:03,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2360 transitions. [2024-11-20 08:45:03,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 08:45:03,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:45:04,000 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:45:04,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2024-11-20 08:45:04,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:45:04,200 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:45:04,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:45:04,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1352566209, now seen corresponding path program 1 times [2024-11-20 08:45:04,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:45:04,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159667317] [2024-11-20 08:45:04,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:45:04,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:45:04,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:45:04,202 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:45:04,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2024-11-20 08:45:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:45:04,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 08:45:04,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:45:04,703 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-20 08:45:04,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:45:04,773 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:45:04,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:45:04,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159667317] [2024-11-20 08:45:04,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159667317] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:45:04,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:45:04,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-20 08:45:04,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816079911] [2024-11-20 08:45:04,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:45:04,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:45:04,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:45:04,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:45:04,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:45:04,774 INFO L87 Difference]: Start difference. First operand 1741 states and 2360 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:45:05,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:45:05,051 INFO L93 Difference]: Finished difference Result 3090 states and 4180 transitions. [2024-11-20 08:45:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:45:05,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-20 08:45:05,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:45:05,055 INFO L225 Difference]: With dead ends: 3090 [2024-11-20 08:45:05,055 INFO L226 Difference]: Without dead ends: 1743 [2024-11-20 08:45:05,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:45:05,057 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 116 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:45:05,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 493 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:45:05,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2024-11-20 08:45:05,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1741. [2024-11-20 08:45:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1741 states, 1608 states have (on average 1.353855721393035) internal successors, (2177), 1619 states have internal predecessors, (2177), 90 states have call successors, (90), 42 states have call predecessors, (90), 42 states have return successors, (90), 79 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-20 08:45:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2357 transitions. [2024-11-20 08:45:05,143 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2357 transitions. Word has length 113 [2024-11-20 08:45:05,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:45:05,144 INFO L471 AbstractCegarLoop]: Abstraction has 1741 states and 2357 transitions. [2024-11-20 08:45:05,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 08:45:05,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2357 transitions. [2024-11-20 08:45:05,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 08:45:05,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:45:05,145 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:45:05,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2024-11-20 08:45:05,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:45:05,345 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:45:05,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:45:05,346 INFO L85 PathProgramCache]: Analyzing trace with hash -496538537, now seen corresponding path program 1 times [2024-11-20 08:45:05,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:45:05,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600933167] [2024-11-20 08:45:05,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:45:05,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:45:05,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:45:05,349 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:45:05,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2024-11-20 08:45:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:45:05,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 08:45:05,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:45:06,594 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 59 treesize of output 43 [2024-11-20 08:45:06,600 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 39 treesize of output 27 [2024-11-20 08:45:06,605 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 38 treesize of output 26 [2024-11-20 08:45:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-20 08:45:06,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:45:06,969 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:45:06,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:45:06,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600933167] [2024-11-20 08:45:06,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600933167] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:45:06,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:45:06,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 22 [2024-11-20 08:45:06,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57125992] [2024-11-20 08:45:06,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:45:06,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:45:06,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:45:06,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:45:06,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2024-11-20 08:45:06,971 INFO L87 Difference]: Start difference. First operand 1741 states and 2357 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)