./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-a_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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-a_file-82.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 67160a6df79d1049c73d7b3dbc4aa323b185d65b8c91424febe1ccb6e4daf12a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:21:03,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:21:03,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:21:03,618 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:21:03,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:21:03,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:21:03,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:21:03,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:21:03,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:21:03,645 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:21:03,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:21:03,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:21:03,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:21:03,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:21:03,647 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:21:03,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:21:03,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:21:03,655 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:21:03,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:21:03,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:21:03,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:21:03,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:21:03,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:21:03,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:21:03,658 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:21:03,658 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:21:03,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:21:03,659 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:21:03,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:21:03,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:21:03,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:21:03,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:21:03,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:21:03,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:21:03,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:21:03,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:21:03,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:21:03,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:21:03,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:21:03,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:21:03,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:21:03,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:21:03,664 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 -> 67160a6df79d1049c73d7b3dbc4aa323b185d65b8c91424febe1ccb6e4daf12a [2024-10-24 11:21:03,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:21:03,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:21:03,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:21:03,939 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:21:03,940 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:21:03,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i [2024-10-24 11:21:05,441 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:21:05,660 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:21:05,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i [2024-10-24 11:21:05,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3e2b57a/18347ac2f5ab458fb916a5d44e9413f1/FLAG51525121d [2024-10-24 11:21:05,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3e2b57a/18347ac2f5ab458fb916a5d44e9413f1 [2024-10-24 11:21:05,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:21:05,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:21:05,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:21:05,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:21:05,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:21:05,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:21:05" (1/1) ... [2024-10-24 11:21:05,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ae98da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:05, skipping insertion in model container [2024-10-24 11:21:05,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:21:05" (1/1) ... [2024-10-24 11:21:05,725 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:21:05,902 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i[916,929] [2024-10-24 11:21:06,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:21:06,025 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:21:06,041 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i[916,929] [2024-10-24 11:21:06,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:21:06,127 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:21:06,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:06 WrapperNode [2024-10-24 11:21:06,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:21:06,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:21:06,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:21:06,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:21:06,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:06" (1/1) ... [2024-10-24 11:21:06,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:06" (1/1) ... [2024-10-24 11:21:06,212 INFO L138 Inliner]: procedures = 29, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 514 [2024-10-24 11:21:06,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:21:06,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:21:06,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:21:06,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:21:06,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:06" (1/1) ... [2024-10-24 11:21:06,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:06" (1/1) ... [2024-10-24 11:21:06,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:06" (1/1) ... [2024-10-24 11:21:06,299 INFO L175 MemorySlicer]: Split 133 memory accesses to 5 slices as follows [2, 10, 6, 41, 74]. 56 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 2, 3, 8]. The 17 writes are split as follows [0, 1, 2, 3, 11]. [2024-10-24 11:21:06,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:06" (1/1) ... [2024-10-24 11:21:06,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:06" (1/1) ... [2024-10-24 11:21:06,321 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:06" (1/1) ... [2024-10-24 11:21:06,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:06" (1/1) ... [2024-10-24 11:21:06,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:06" (1/1) ... [2024-10-24 11:21:06,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:06" (1/1) ... [2024-10-24 11:21:06,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:21:06,361 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:21:06,365 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:21:06,365 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:21:06,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:06" (1/1) ... [2024-10-24 11:21:06,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:21:06,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:21:06,413 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:21:06,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:21:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:21:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:21:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:21:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:21:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:21:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:21:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:21:06,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:21:06,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:21:06,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:21:06,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:21:06,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:21:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:21:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:21:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:21:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:21:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:21:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:21:06,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:21:06,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:21:06,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:21:06,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:21:06,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:21:06,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:21:06,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:21:06,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:21:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:21:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:21:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:21:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:21:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:21:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:21:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:21:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:21:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:21:06,641 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:21:06,644 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:21:07,231 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-10-24 11:21:07,232 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:21:07,263 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:21:07,264 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:21:07,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:21:07 BoogieIcfgContainer [2024-10-24 11:21:07,264 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:21:07,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:21:07,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:21:07,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:21:07,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:21:05" (1/3) ... [2024-10-24 11:21:07,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30667a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:21:07, skipping insertion in model container [2024-10-24 11:21:07,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:06" (2/3) ... [2024-10-24 11:21:07,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30667a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:21:07, skipping insertion in model container [2024-10-24 11:21:07,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:21:07" (3/3) ... [2024-10-24 11:21:07,273 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-82.i [2024-10-24 11:21:07,287 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:21:07,288 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:21:07,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:21:07,358 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;@34bf4fe8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:21:07,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:21:07,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 91 states have (on average 1.4615384615384615) internal successors, (133), 92 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:21:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:21:07,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:07,379 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:07,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:07,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:07,386 INFO L85 PathProgramCache]: Analyzing trace with hash 972610556, now seen corresponding path program 1 times [2024-10-24 11:21:07,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:07,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995877246] [2024-10-24 11:21:07,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:07,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:07,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:07,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:07,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:21:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:07,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:21:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:07,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:21:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:07,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:07,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:21:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:07,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:21:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:07,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:21:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:07,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:21:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:07,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:21:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:07,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:21:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:07,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:21:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:07,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:21:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:07,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:07,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995877246] [2024-10-24 11:21:07,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995877246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:07,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:07,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:21:07,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521470265] [2024-10-24 11:21:07,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:07,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:21:07,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:07,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:21:07,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:21:07,902 INFO L87 Difference]: Start difference. First operand has 108 states, 91 states have (on average 1.4615384615384615) internal successors, (133), 92 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:21:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:07,954 INFO L93 Difference]: Finished difference Result 213 states and 334 transitions. [2024-10-24 11:21:07,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:21:07,957 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-10-24 11:21:07,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:07,967 INFO L225 Difference]: With dead ends: 213 [2024-10-24 11:21:07,968 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 11:21:07,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-10-24 11:21:07,978 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:07,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:21:07,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 11:21:08,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-24 11:21:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:21:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2024-10-24 11:21:08,030 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 116 [2024-10-24 11:21:08,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:08,031 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2024-10-24 11:21:08,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:21:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2024-10-24 11:21:08,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:21:08,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:08,038 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:08,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:21:08,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:08,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:08,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1326638682, now seen corresponding path program 1 times [2024-10-24 11:21:08,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:08,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824236439] [2024-10-24 11:21:08,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:08,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:21:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:21:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:21:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:21:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:21:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:21:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:21:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:21:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:21:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:21:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:21:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:08,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:08,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824236439] [2024-10-24 11:21:08,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824236439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:08,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:08,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:21:08,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794947229] [2024-10-24 11:21:08,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:08,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:21:08,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:08,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:21:08,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:21:08,388 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:21:08,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:08,457 INFO L93 Difference]: Finished difference Result 213 states and 306 transitions. [2024-10-24 11:21:08,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:21:08,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-10-24 11:21:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:08,461 INFO L225 Difference]: With dead ends: 213 [2024-10-24 11:21:08,461 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 11:21:08,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-10-24 11:21:08,464 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:08,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 431 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:21:08,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 11:21:08,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-24 11:21:08,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:21:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2024-10-24 11:21:08,502 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 116 [2024-10-24 11:21:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:08,504 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2024-10-24 11:21:08,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:21:08,507 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2024-10-24 11:21:08,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:21:08,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:08,509 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:08,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:21:08,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:08,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:08,510 INFO L85 PathProgramCache]: Analyzing trace with hash 540069992, now seen corresponding path program 1 times [2024-10-24 11:21:08,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:08,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352765614] [2024-10-24 11:21:08,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:08,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:21:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:21:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:21:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:21:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:21:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:21:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:21:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:21:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:21:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:21:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:21:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:08,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:08,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352765614] [2024-10-24 11:21:08,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352765614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:08,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:08,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:21:08,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058624550] [2024-10-24 11:21:08,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:08,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:21:08,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:08,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:21:08,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:21:08,865 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:08,914 INFO L93 Difference]: Finished difference Result 217 states and 310 transitions. [2024-10-24 11:21:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:21:08,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-10-24 11:21:08,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:08,917 INFO L225 Difference]: With dead ends: 217 [2024-10-24 11:21:08,917 INFO L226 Difference]: Without dead ends: 110 [2024-10-24 11:21:08,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 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-10-24 11:21:08,921 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:08,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 431 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:21:08,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-24 11:21:08,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-24 11:21:08,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:21:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2024-10-24 11:21:08,940 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 116 [2024-10-24 11:21:08,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:08,941 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2024-10-24 11:21:08,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:08,941 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2024-10-24 11:21:08,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 11:21:08,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:08,945 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:08,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:21:08,946 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:08,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:08,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1939529334, now seen corresponding path program 1 times [2024-10-24 11:21:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:08,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426035923] [2024-10-24 11:21:08,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:08,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:21:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:21:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:21:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:21:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:21:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:21:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:21:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:21:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:21:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:21:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:21:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:09,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:09,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426035923] [2024-10-24 11:21:09,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426035923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:09,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:09,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:21:09,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156449340] [2024-10-24 11:21:09,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:09,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:21:09,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:09,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:21:09,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:21:09,225 INFO L87 Difference]: Start difference. First operand 110 states and 156 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:09,274 INFO L93 Difference]: Finished difference Result 222 states and 315 transitions. [2024-10-24 11:21:09,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:21:09,275 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-24 11:21:09,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:09,277 INFO L225 Difference]: With dead ends: 222 [2024-10-24 11:21:09,277 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 11:21:09,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:21:09,278 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:09,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 571 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:21:09,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 11:21:09,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2024-10-24 11:21:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:21:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions. [2024-10-24 11:21:09,298 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 157 transitions. Word has length 118 [2024-10-24 11:21:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:09,299 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 157 transitions. [2024-10-24 11:21:09,299 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions. [2024-10-24 11:21:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 11:21:09,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:09,303 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:09,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:21:09,303 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:09,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:09,304 INFO L85 PathProgramCache]: Analyzing trace with hash 395898225, now seen corresponding path program 1 times [2024-10-24 11:21:09,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:09,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565423532] [2024-10-24 11:21:09,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:09,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:21:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:21:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:21:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:21:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:21:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:21:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:21:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:21:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:21:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:21:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:21:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:09,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:09,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565423532] [2024-10-24 11:21:09,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565423532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:09,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:09,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:21:09,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247474477] [2024-10-24 11:21:09,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:09,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:21:09,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:09,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:21:09,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:21:09,470 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:09,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:09,508 INFO L93 Difference]: Finished difference Result 224 states and 317 transitions. [2024-10-24 11:21:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:21:09,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2024-10-24 11:21:09,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:09,512 INFO L225 Difference]: With dead ends: 224 [2024-10-24 11:21:09,512 INFO L226 Difference]: Without dead ends: 114 [2024-10-24 11:21:09,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-10-24 11:21:09,513 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:09,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 428 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:21:09,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-24 11:21:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-24 11:21:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:21:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2024-10-24 11:21:09,526 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 120 [2024-10-24 11:21:09,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:09,526 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2024-10-24 11:21:09,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:09,527 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2024-10-24 11:21:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 11:21:09,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:09,528 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:09,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:21:09,528 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:09,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:09,529 INFO L85 PathProgramCache]: Analyzing trace with hash -413448401, now seen corresponding path program 1 times [2024-10-24 11:21:09,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:09,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891359931] [2024-10-24 11:21:09,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:09,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:21:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:21:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:21:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:21:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:21:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:21:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:21:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:21:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:21:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:21:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:21:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,692 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:09,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:09,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891359931] [2024-10-24 11:21:09,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891359931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:09,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:09,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:21:09,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351263914] [2024-10-24 11:21:09,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:09,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:21:09,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:09,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:21:09,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:21:09,695 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:09,729 INFO L93 Difference]: Finished difference Result 228 states and 321 transitions. [2024-10-24 11:21:09,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:21:09,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2024-10-24 11:21:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:09,732 INFO L225 Difference]: With dead ends: 228 [2024-10-24 11:21:09,732 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 11:21:09,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-10-24 11:21:09,733 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:09,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 429 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:21:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 11:21:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-10-24 11:21:09,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 99 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:21:09,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2024-10-24 11:21:09,750 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 120 [2024-10-24 11:21:09,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:09,751 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2024-10-24 11:21:09,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:09,751 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2024-10-24 11:21:09,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 11:21:09,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:09,752 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:09,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:21:09,752 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:09,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash -356190099, now seen corresponding path program 1 times [2024-10-24 11:21:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:09,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363854030] [2024-10-24 11:21:09,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:21:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:21:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:21:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:21:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:21:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:21:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:21:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:21:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:21:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:21:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:21:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:09,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:09,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363854030] [2024-10-24 11:21:09,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363854030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:09,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:09,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:21:09,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688844309] [2024-10-24 11:21:09,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:09,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:21:09,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:09,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:21:09,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:21:09,910 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:09,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:09,941 INFO L93 Difference]: Finished difference Result 232 states and 325 transitions. [2024-10-24 11:21:09,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:21:09,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2024-10-24 11:21:09,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:09,943 INFO L225 Difference]: With dead ends: 232 [2024-10-24 11:21:09,944 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 11:21:09,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-10-24 11:21:09,945 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:09,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 432 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:21:09,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 11:21:09,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-10-24 11:21:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.3366336633663367) internal successors, (135), 101 states have internal predecessors, (135), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:21:09,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 163 transitions. [2024-10-24 11:21:09,958 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 163 transitions. Word has length 120 [2024-10-24 11:21:09,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:09,958 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 163 transitions. [2024-10-24 11:21:09,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:09,959 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 163 transitions. [2024-10-24 11:21:09,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 11:21:09,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:09,960 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:09,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:21:09,960 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:09,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:09,962 INFO L85 PathProgramCache]: Analyzing trace with hash -356130517, now seen corresponding path program 1 times [2024-10-24 11:21:09,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:09,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401390776] [2024-10-24 11:21:09,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:09,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:10,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:10,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:10,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:21:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:10,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:21:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:10,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:21:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:10,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:10,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:21:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:10,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:21:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:10,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:21:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:10,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:21:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:10,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:21:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:10,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:21:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:10,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:21:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:10,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:21:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:10,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:10,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401390776] [2024-10-24 11:21:10,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401390776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:10,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:10,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:21:10,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621366318] [2024-10-24 11:21:10,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:10,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:21:10,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:10,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:21:10,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:21:10,493 INFO L87 Difference]: Start difference. First operand 117 states and 163 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:21:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:10,569 INFO L93 Difference]: Finished difference Result 284 states and 394 transitions. [2024-10-24 11:21:10,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:21:10,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2024-10-24 11:21:10,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:10,572 INFO L225 Difference]: With dead ends: 284 [2024-10-24 11:21:10,572 INFO L226 Difference]: Without dead ends: 168 [2024-10-24 11:21:10,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:21:10,573 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 59 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:10,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 694 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:21:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-24 11:21:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 127. [2024-10-24 11:21:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 111 states have internal predecessors, (150), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:21:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 178 transitions. [2024-10-24 11:21:10,586 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 178 transitions. Word has length 120 [2024-10-24 11:21:10,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:10,587 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 178 transitions. [2024-10-24 11:21:10,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:21:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 178 transitions. [2024-10-24 11:21:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 11:21:10,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:10,588 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:10,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:21:10,589 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:10,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash 870418686, now seen corresponding path program 1 times [2024-10-24 11:21:10,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:10,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878691114] [2024-10-24 11:21:10,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:10,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:12,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:12,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:12,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:21:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:12,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:21:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:12,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:21:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:12,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:12,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:21:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:12,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:21:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:12,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:21:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:12,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:21:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:12,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:21:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:12,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:21:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:12,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:21:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:12,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:21:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:12,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:12,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878691114] [2024-10-24 11:21:12,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878691114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:12,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:12,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:21:12,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686693716] [2024-10-24 11:21:12,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:12,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:21:12,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:12,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:21:12,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:21:12,350 INFO L87 Difference]: Start difference. First operand 127 states and 178 transitions. Second operand has 12 states, 10 states have (on average 5.4) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 11:21:12,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:12,865 INFO L93 Difference]: Finished difference Result 357 states and 500 transitions. [2024-10-24 11:21:12,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:21:12,868 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.4) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2024-10-24 11:21:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:12,869 INFO L225 Difference]: With dead ends: 357 [2024-10-24 11:21:12,869 INFO L226 Difference]: Without dead ends: 231 [2024-10-24 11:21:12,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:21:12,870 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 107 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:12,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1526 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:21:12,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-24 11:21:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2024-10-24 11:21:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 205 states have (on average 1.3658536585365855) internal successors, (280), 206 states have internal predecessors, (280), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:21:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 320 transitions. [2024-10-24 11:21:12,883 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 320 transitions. Word has length 121 [2024-10-24 11:21:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:12,884 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 320 transitions. [2024-10-24 11:21:12,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.4) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 11:21:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 320 transitions. [2024-10-24 11:21:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 11:21:12,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:12,885 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:12,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:21:12,886 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:12,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:12,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1211925611, now seen corresponding path program 1 times [2024-10-24 11:21:12,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:12,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533803712] [2024-10-24 11:21:12,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:12,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:21:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:21:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:21:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:21:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:21:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:21:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:21:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:21:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:21:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:21:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:21:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:13,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:13,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533803712] [2024-10-24 11:21:13,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533803712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:13,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:13,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:21:13,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811644491] [2024-10-24 11:21:13,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:13,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:21:13,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:13,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:21:13,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:21:13,076 INFO L87 Difference]: Start difference. First operand 228 states and 320 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:13,188 INFO L93 Difference]: Finished difference Result 603 states and 848 transitions. [2024-10-24 11:21:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:21:13,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-10-24 11:21:13,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:13,193 INFO L225 Difference]: With dead ends: 603 [2024-10-24 11:21:13,193 INFO L226 Difference]: Without dead ends: 376 [2024-10-24 11:21:13,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:21:13,194 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 72 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:13,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 683 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:21:13,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-10-24 11:21:13,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 310. [2024-10-24 11:21:13,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 287 states have (on average 1.4006968641114983) internal successors, (402), 288 states have internal predecessors, (402), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:21:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 442 transitions. [2024-10-24 11:21:13,209 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 442 transitions. Word has length 121 [2024-10-24 11:21:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:13,209 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 442 transitions. [2024-10-24 11:21:13,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 442 transitions. [2024-10-24 11:21:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 11:21:13,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:13,212 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:13,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:21:13,212 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:13,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:13,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1461803436, now seen corresponding path program 1 times [2024-10-24 11:21:13,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:13,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094262528] [2024-10-24 11:21:13,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:13,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:21:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:21:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:21:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:21:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:21:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:21:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:21:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:21:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:21:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:21:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:21:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:13,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:13,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094262528] [2024-10-24 11:21:13,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094262528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:13,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:13,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:21:13,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850621374] [2024-10-24 11:21:13,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:13,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:21:13,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:13,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:21:13,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:21:13,588 INFO L87 Difference]: Start difference. First operand 310 states and 442 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:21:13,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:13,687 INFO L93 Difference]: Finished difference Result 692 states and 977 transitions. [2024-10-24 11:21:13,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:21:13,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2024-10-24 11:21:13,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:13,690 INFO L225 Difference]: With dead ends: 692 [2024-10-24 11:21:13,691 INFO L226 Difference]: Without dead ends: 383 [2024-10-24 11:21:13,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:21:13,692 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 65 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:13,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 831 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:21:13,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-24 11:21:13,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 290. [2024-10-24 11:21:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 267 states have (on average 1.3857677902621723) internal successors, (370), 268 states have internal predecessors, (370), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:21:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 410 transitions. [2024-10-24 11:21:13,706 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 410 transitions. Word has length 121 [2024-10-24 11:21:13,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:13,706 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 410 transitions. [2024-10-24 11:21:13,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:21:13,707 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 410 transitions. [2024-10-24 11:21:13,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 11:21:13,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:13,708 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:13,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:21:13,708 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:13,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:13,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2041663765, now seen corresponding path program 1 times [2024-10-24 11:21:13,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:13,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670022794] [2024-10-24 11:21:13,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:13,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:21:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:21:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:21:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:21:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:21:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:21:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:21:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:21:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:21:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:21:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:21:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:13,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:13,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670022794] [2024-10-24 11:21:13,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670022794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:13,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:13,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:21:13,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305123345] [2024-10-24 11:21:13,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:13,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:21:13,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:13,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:21:13,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:21:13,862 INFO L87 Difference]: Start difference. First operand 290 states and 410 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:13,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:13,957 INFO L93 Difference]: Finished difference Result 583 states and 823 transitions. [2024-10-24 11:21:13,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:21:13,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-10-24 11:21:13,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:13,959 INFO L225 Difference]: With dead ends: 583 [2024-10-24 11:21:13,959 INFO L226 Difference]: Without dead ends: 293 [2024-10-24 11:21:13,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:21:13,960 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 63 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:13,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 856 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:21:13,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-24 11:21:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2024-10-24 11:21:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 267 states have (on average 1.3745318352059925) internal successors, (367), 268 states have internal predecessors, (367), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:21:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 407 transitions. [2024-10-24 11:21:13,970 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 407 transitions. Word has length 121 [2024-10-24 11:21:13,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:13,971 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 407 transitions. [2024-10-24 11:21:13,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 407 transitions. [2024-10-24 11:21:13,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 11:21:13,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:13,972 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:13,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:21:13,973 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:13,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:13,973 INFO L85 PathProgramCache]: Analyzing trace with hash -40680532, now seen corresponding path program 1 times [2024-10-24 11:21:13,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:13,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671261731] [2024-10-24 11:21:13,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:13,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:14,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:21:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:14,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:21:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:14,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:21:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:14,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:21:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:14,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:21:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:14,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:21:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:14,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:21:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:14,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:21:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:14,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:21:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:14,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:21:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:14,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:21:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:14,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:21:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:14,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:21:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:14,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:21:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:14,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:21:14,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671261731] [2024-10-24 11:21:14,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671261731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:14,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:14,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:21:14,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657257021] [2024-10-24 11:21:14,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:14,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:21:14,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:21:14,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:21:14,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:21:14,198 INFO L87 Difference]: Start difference. First operand 290 states and 407 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:14,500 INFO L93 Difference]: Finished difference Result 767 states and 1070 transitions. [2024-10-24 11:21:14,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:21:14,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-10-24 11:21:14,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:14,503 INFO L225 Difference]: With dead ends: 767 [2024-10-24 11:21:14,503 INFO L226 Difference]: Without dead ends: 478 [2024-10-24 11:21:14,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:21:14,505 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 184 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:14,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 611 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:21:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-24 11:21:14,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 441. [2024-10-24 11:21:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 396 states have (on average 1.351010101010101) internal successors, (535), 398 states have internal predecessors, (535), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:21:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 615 transitions. [2024-10-24 11:21:14,525 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 615 transitions. Word has length 121 [2024-10-24 11:21:14,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:14,525 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 615 transitions. [2024-10-24 11:21:14,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:14,526 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 615 transitions. [2024-10-24 11:21:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 11:21:14,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:14,527 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:14,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:21:14,527 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:14,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1466813383, now seen corresponding path program 1 times [2024-10-24 11:21:14,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:21:14,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860078878] [2024-10-24 11:21:14,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:14,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:21:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:21:14,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:21:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:21:14,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:21:14,784 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:21:14,785 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:21:14,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:21:14,789 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:14,886 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:21:14,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:21:14 BoogieIcfgContainer [2024-10-24 11:21:14,891 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:21:14,891 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:21:14,891 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:21:14,892 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:21:14,892 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:21:07" (3/4) ... [2024-10-24 11:21:14,894 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:21:14,895 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:21:14,895 INFO L158 Benchmark]: Toolchain (without parser) took 9205.68ms. Allocated memory was 134.2MB in the beginning and 262.1MB in the end (delta: 127.9MB). Free memory was 79.7MB in the beginning and 115.9MB in the end (delta: -36.1MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2024-10-24 11:21:14,895 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 134.2MB. Free memory was 95.5MB in the beginning and 95.4MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:21:14,896 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.64ms. Allocated memory is still 134.2MB. Free memory was 79.4MB in the beginning and 61.4MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 11:21:14,896 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.94ms. Allocated memory is still 134.2MB. Free memory was 61.4MB in the beginning and 104.2MB in the end (delta: -42.7MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-10-24 11:21:14,897 INFO L158 Benchmark]: Boogie Preprocessor took 148.05ms. Allocated memory is still 134.2MB. Free memory was 104.2MB in the beginning and 98.2MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:21:14,897 INFO L158 Benchmark]: RCFGBuilder took 902.74ms. Allocated memory is still 134.2MB. Free memory was 98.2MB in the beginning and 56.8MB in the end (delta: 41.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-24 11:21:14,897 INFO L158 Benchmark]: TraceAbstraction took 7624.42ms. Allocated memory was 134.2MB in the beginning and 262.1MB in the end (delta: 127.9MB). Free memory was 56.2MB in the beginning and 115.9MB in the end (delta: -59.7MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2024-10-24 11:21:14,898 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 262.1MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:21:14,899 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.21ms. Allocated memory is still 134.2MB. Free memory was 95.5MB in the beginning and 95.4MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 435.64ms. Allocated memory is still 134.2MB. Free memory was 79.4MB in the beginning and 61.4MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.94ms. Allocated memory is still 134.2MB. Free memory was 61.4MB in the beginning and 104.2MB in the end (delta: -42.7MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 148.05ms. Allocated memory is still 134.2MB. Free memory was 104.2MB in the beginning and 98.2MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 902.74ms. Allocated memory is still 134.2MB. Free memory was 98.2MB in the beginning and 56.8MB in the end (delta: 41.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7624.42ms. Allocated memory was 134.2MB in the beginning and 262.1MB in the end (delta: 127.9MB). Free memory was 56.2MB in the beginning and 115.9MB in the end (delta: -59.7MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 262.1MB. Free memory is still 115.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 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] double double_Array_0[2] = { 3.75, 255.5 }; [L25-L27] double double_Array_0[2] = { 3.75, 255.5 }; [L25-L27] double double_Array_0[2] = { 3.75, 255.5 }; [L28-L30] float float_Array_0[3] = { 255.5, 63.5, 128.75 }; [L28-L30] float float_Array_0[3] = { 255.5, 63.5, 128.75 }; [L28-L30] float float_Array_0[3] = { 255.5, 63.5, 128.75 }; [L28-L30] float float_Array_0[3] = { 255.5, 63.5, 128.75 }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L34] unsigned char last_1_unsigned_char_Array_0_0__0__0_ = 2; [L35] unsigned char last_1_unsigned_char_Array_0_0__0__1_ = 0; [L36] unsigned char last_1_unsigned_char_Array_0_1__1__1_ = 32; [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L92] EXPR unsigned_char_Array_0[0][0][0] [L92] last_1_unsigned_char_Array_0_0__0__0_ = unsigned_char_Array_0[0][0][0] [L93] EXPR unsigned_char_Array_0[0][0][1] [L93] last_1_unsigned_char_Array_0_0__0__1_ = unsigned_char_Array_0[0][0][1] [L94] EXPR unsigned_char_Array_0[1][1][1] [L94] last_1_unsigned_char_Array_0_1__1__1_ = unsigned_char_Array_0[1][1][1] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L68] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L71] float_Array_0[0] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L73] float_Array_0[1] = __VERIFIER_nondet_float() [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L75] unsigned_char_Array_0[1][0][0] = __VERIFIER_nondet_uchar() [L76] EXPR unsigned_char_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L76] CALL assume_abort_if_not(unsigned_char_Array_0[1][0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L76] RET assume_abort_if_not(unsigned_char_Array_0[1][0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L77] EXPR unsigned_char_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(unsigned_char_Array_0[1][0][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L77] RET assume_abort_if_not(unsigned_char_Array_0[1][0][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L78] unsigned_char_Array_0[0][1][0] = __VERIFIER_nondet_uchar() [L79] EXPR unsigned_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L79] CALL assume_abort_if_not(unsigned_char_Array_0[0][1][0] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L79] RET assume_abort_if_not(unsigned_char_Array_0[0][1][0] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L80] EXPR unsigned_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(unsigned_char_Array_0[0][1][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L80] RET assume_abort_if_not(unsigned_char_Array_0[0][1][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L81] unsigned_char_Array_0[1][1][0] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[1][1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[1][1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L83] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[1][1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[1][1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L84] unsigned_char_Array_0[1][0][1] = __VERIFIER_nondet_uchar() [L85] EXPR unsigned_char_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L86] EXPR unsigned_char_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[1][0][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[1][0][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L87] unsigned_char_Array_0[0][1][1] = __VERIFIER_nondet_uchar() [L88] EXPR unsigned_char_Array_0[0][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[0][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[0][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L89] EXPR unsigned_char_Array_0[0][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0][1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0][1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L105] RET updateVariables() [L106] CALL step() [L40] EXPR last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_ VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L40] signed long int stepLocal_0 = last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_; [L41] COND FALSE !((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= stepLocal_0) [L44] EXPR unsigned_char_Array_0[0][1][0] [L44] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L44] EXPR ((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]) [L44] EXPR unsigned_char_Array_0[1][1][0] [L44] EXPR ((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L44] unsigned_char_Array_0[1][1][1] = (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))) [L46] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L46] COND FALSE !(! BOOL_unsigned_char_Array_0[0]) [L51] EXPR float_Array_0[0] [L51] double_Array_0[0] = float_Array_0[0] [L52] EXPR unsigned_char_Array_0[1][0][0] [L52] unsigned_char_Array_0[0][0][1] = unsigned_char_Array_0[1][0][0] [L53] EXPR float_Array_0[1] [L53] double_Array_0[1] = float_Array_0[1] [L54] EXPR unsigned_char_Array_0[1][0][0] [L54] unsigned char stepLocal_1 = unsigned_char_Array_0[1][0][0]; [L55] EXPR unsigned_char_Array_0[1][1][1] [L55] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L55] COND FALSE !((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= stepLocal_1) [L64] EXPR unsigned_char_Array_0[1][0][0] [L64] unsigned_char_Array_0[0][0][0] = unsigned_char_Array_0[1][0][0] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1 [L97] EXPR (! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_ VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))) [L97] EXPR unsigned_char_Array_0[1][1][1] [L97] EXPR unsigned_char_Array_0[0][1][0] [L97] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]) [L97] EXPR unsigned_char_Array_0[1][1][0] [L97] EXPR ((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) [L97] EXPR unsigned_char_Array_0[1][1][1] [L97] EXPR unsigned_char_Array_0[1][1][0] [L97] EXPR unsigned_char_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])) [L97] EXPR unsigned_char_Array_0[0][0][0] [L97] EXPR unsigned_char_Array_0[1][0][0] [L97] EXPR ((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0])) [L97] EXPR double_Array_0[0] [L97] EXPR float_Array_0[0] [L97] EXPR ((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0])) [L97] EXPR unsigned_char_Array_0[0][0][1] [L97] EXPR unsigned_char_Array_0[1][0][0] [L97] EXPR (((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) && (double_Array_0[1] == ((double) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) && (double_Array_0[1] == ((double) float_Array_0[1])) [L97] EXPR double_Array_0[1] [L97] EXPR float_Array_0[1] [L97] EXPR ((((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) && (double_Array_0[1] == ((double) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97-L98] return ((((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) && (double_Array_0[1] == ((double) float_Array_0[1])) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 14, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 557 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 553 mSDsluCounter, 8071 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6078 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1255 IncrementalHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 1993 mSDtfsCounter, 1255 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=441occurred in iteration=13, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 248 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1674 NumberOfCodeBlocks, 1674 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1538 ConstructedInterpolants, 0 QuantifiedInterpolants, 2429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 4732/4732 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-10-24 11:21:14,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-a_file-82.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 67160a6df79d1049c73d7b3dbc4aa323b185d65b8c91424febe1ccb6e4daf12a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:21:17,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:21:17,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:21:17,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:21:17,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:21:17,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:21:17,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:21:17,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:21:17,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:21:17,298 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:21:17,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:21:17,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:21:17,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:21:17,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:21:17,300 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:21:17,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:21:17,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:21:17,301 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:21:17,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:21:17,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:21:17,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:21:17,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:21:17,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:21:17,307 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:21:17,307 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:21:17,310 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:21:17,310 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:21:17,310 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:21:17,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:21:17,311 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:21:17,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:21:17,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:21:17,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:21:17,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:21:17,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:21:17,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:21:17,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:21:17,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:21:17,315 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:21:17,315 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:21:17,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:21:17,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:21:17,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:21:17,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:21:17,316 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:21:17,317 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 -> 67160a6df79d1049c73d7b3dbc4aa323b185d65b8c91424febe1ccb6e4daf12a [2024-10-24 11:21:17,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:21:17,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:21:17,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:21:17,651 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:21:17,652 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:21:17,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i [2024-10-24 11:21:19,213 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:21:19,439 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:21:19,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i [2024-10-24 11:21:19,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cd1b4ab7/0f74c336fe8a4e5e8bbb18a103374062/FLAG5829c70ce [2024-10-24 11:21:19,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cd1b4ab7/0f74c336fe8a4e5e8bbb18a103374062 [2024-10-24 11:21:19,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:21:19,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:21:19,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:21:19,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:21:19,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:21:19,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:21:19" (1/1) ... [2024-10-24 11:21:19,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c57eaf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:19, skipping insertion in model container [2024-10-24 11:21:19,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:21:19" (1/1) ... [2024-10-24 11:21:19,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:21:19,723 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i[916,929] [2024-10-24 11:21:19,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:21:19,845 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:21:19,860 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i[916,929] [2024-10-24 11:21:19,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:21:19,953 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:21:19,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:19 WrapperNode [2024-10-24 11:21:19,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:21:19,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:21:19,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:21:19,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:21:19,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:19" (1/1) ... [2024-10-24 11:21:19,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:19" (1/1) ... [2024-10-24 11:21:20,018 INFO L138 Inliner]: procedures = 33, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 497 [2024-10-24 11:21:20,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:21:20,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:21:20,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:21:20,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:21:20,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:19" (1/1) ... [2024-10-24 11:21:20,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:19" (1/1) ... [2024-10-24 11:21:20,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:19" (1/1) ... [2024-10-24 11:21:20,070 INFO L175 MemorySlicer]: Split 133 memory accesses to 5 slices as follows [2, 10, 6, 41, 74]. 56 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 2, 3, 8]. The 17 writes are split as follows [0, 1, 2, 3, 11]. [2024-10-24 11:21:20,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:19" (1/1) ... [2024-10-24 11:21:20,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:19" (1/1) ... [2024-10-24 11:21:20,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:19" (1/1) ... [2024-10-24 11:21:20,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:19" (1/1) ... [2024-10-24 11:21:20,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:19" (1/1) ... [2024-10-24 11:21:20,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:19" (1/1) ... [2024-10-24 11:21:20,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:21:20,132 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:21:20,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:21:20,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:21:20,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:19" (1/1) ... [2024-10-24 11:21:20,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:21:20,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:21:20,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:21:20,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:21:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:21:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:21:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:21:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-24 11:21:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-24 11:21:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-24 11:21:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:21:20,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:21:20,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-24 11:21:20,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-24 11:21:20,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-24 11:21:20,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:21:20,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:21:20,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:21:20,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:21:20,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:21:20,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:21:20,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:21:20,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:21:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:21:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:21:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:21:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:21:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-24 11:21:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-24 11:21:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-24 11:21:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:21:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:21:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-24 11:21:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-24 11:21:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-24 11:21:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:21:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:21:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-24 11:21:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-24 11:21:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-24 11:21:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:21:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:21:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-24 11:21:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-24 11:21:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-24 11:21:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:21:20,231 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:21:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:21:20,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:21:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:21:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:21:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:21:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:21:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:21:20,392 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:21:20,394 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:21:22,042 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-10-24 11:21:22,042 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:21:22,094 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:21:22,095 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:21:22,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:21:22 BoogieIcfgContainer [2024-10-24 11:21:22,096 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:21:22,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:21:22,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:21:22,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:21:22,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:21:19" (1/3) ... [2024-10-24 11:21:22,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e413a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:21:22, skipping insertion in model container [2024-10-24 11:21:22,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:21:19" (2/3) ... [2024-10-24 11:21:22,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e413a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:21:22, skipping insertion in model container [2024-10-24 11:21:22,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:21:22" (3/3) ... [2024-10-24 11:21:22,105 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-82.i [2024-10-24 11:21:22,121 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:21:22,122 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:21:22,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:21:22,184 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;@40e00f2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:21:22,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:21:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:21:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:21:22,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:22,200 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:22,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:22,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:22,205 INFO L85 PathProgramCache]: Analyzing trace with hash -235031558, now seen corresponding path program 1 times [2024-10-24 11:21:22,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:22,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178024250] [2024-10-24 11:21:22,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:22,218 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-10-24 11:21:22,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:22,219 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-10-24 11:21:22,236 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-10-24 11:21:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:22,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:21:22,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:22,578 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-10-24 11:21:22,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:22,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:22,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178024250] [2024-10-24 11:21:22,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178024250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:22,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:22,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:21:22,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096697693] [2024-10-24 11:21:22,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:22,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:21:22,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:22,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:21:22,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:21:22,622 INFO L87 Difference]: Start difference. First operand has 101 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:21:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:22,678 INFO L93 Difference]: Finished difference Result 199 states and 312 transitions. [2024-10-24 11:21:22,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:21:22,681 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-10-24 11:21:22,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:22,689 INFO L225 Difference]: With dead ends: 199 [2024-10-24 11:21:22,689 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 11:21:22,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-10-24 11:21:22,696 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:22,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:21:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 11:21:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-24 11:21:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:21:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-10-24 11:21:22,740 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 114 [2024-10-24 11:21:22,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:22,740 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-10-24 11:21:22,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:21:22,741 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-10-24 11:21:22,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:21:22,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:22,748 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:22,756 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 (2)] Ended with exit code 0 [2024-10-24 11:21:22,952 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-10-24 11:21:22,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:22,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:22,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1328970660, now seen corresponding path program 1 times [2024-10-24 11:21:22,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:22,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414659618] [2024-10-24 11:21:22,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:22,955 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-10-24 11:21:22,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:22,956 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-10-24 11:21:22,957 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-10-24 11:21:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:23,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:21:23,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:23,256 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-10-24 11:21:23,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:23,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:23,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414659618] [2024-10-24 11:21:23,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414659618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:23,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:23,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:21:23,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523480810] [2024-10-24 11:21:23,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:23,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:21:23,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:23,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:21:23,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:21:23,261 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:21:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:23,358 INFO L93 Difference]: Finished difference Result 199 states and 284 transitions. [2024-10-24 11:21:23,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:21:23,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-10-24 11:21:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:23,360 INFO L225 Difference]: With dead ends: 199 [2024-10-24 11:21:23,360 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 11:21:23,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 111 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-10-24 11:21:23,364 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:23,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 398 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:21:23,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 11:21:23,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-24 11:21:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:21:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-10-24 11:21:23,376 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 114 [2024-10-24 11:21:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:23,378 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-10-24 11:21:23,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:21:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-10-24 11:21:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:21:23,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:23,381 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:23,390 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 (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:21:23,582 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-10-24 11:21:23,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:23,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:23,583 INFO L85 PathProgramCache]: Analyzing trace with hash -568526106, now seen corresponding path program 1 times [2024-10-24 11:21:23,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:23,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880483055] [2024-10-24 11:21:23,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:23,585 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-10-24 11:21:23,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:23,588 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-10-24 11:21:23,589 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-10-24 11:21:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:23,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:21:23,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:23,998 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 9 [2024-10-24 11:21:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:24,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:24,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:24,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880483055] [2024-10-24 11:21:24,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880483055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:24,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:24,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:21:24,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919373348] [2024-10-24 11:21:24,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:24,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:21:24,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:24,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:21:24,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:21:24,354 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:24,953 INFO L93 Difference]: Finished difference Result 298 states and 424 transitions. [2024-10-24 11:21:24,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:21:24,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-24 11:21:24,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:24,957 INFO L225 Difference]: With dead ends: 298 [2024-10-24 11:21:24,957 INFO L226 Difference]: Without dead ends: 198 [2024-10-24 11:21:24,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:21:24,962 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 113 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:24,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 447 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:21:24,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-24 11:21:24,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 171. [2024-10-24 11:21:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 140 states have (on average 1.3428571428571427) internal successors, (188), 140 states have internal predecessors, (188), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:21:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 244 transitions. [2024-10-24 11:21:24,983 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 244 transitions. Word has length 114 [2024-10-24 11:21:24,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:24,984 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 244 transitions. [2024-10-24 11:21:24,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 244 transitions. [2024-10-24 11:21:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:21:24,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:24,986 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:24,996 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 (4)] Ended with exit code 0 [2024-10-24 11:21:25,190 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-10-24 11:21:25,191 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:25,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:25,192 INFO L85 PathProgramCache]: Analyzing trace with hash 786543965, now seen corresponding path program 1 times [2024-10-24 11:21:25,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:25,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097497491] [2024-10-24 11:21:25,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:25,193 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-10-24 11:21:25,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:25,196 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-10-24 11:21:25,200 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-10-24 11:21:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:21:25,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:25,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:25,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:25,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097497491] [2024-10-24 11:21:25,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097497491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:25,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:25,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:21:25,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242611453] [2024-10-24 11:21:25,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:25,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:21:25,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:25,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:21:25,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:21:25,488 INFO L87 Difference]: Start difference. First operand 171 states and 244 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:25,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:25,544 INFO L93 Difference]: Finished difference Result 275 states and 392 transitions. [2024-10-24 11:21:25,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:21:25,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-24 11:21:25,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:25,547 INFO L225 Difference]: With dead ends: 275 [2024-10-24 11:21:25,547 INFO L226 Difference]: Without dead ends: 175 [2024-10-24 11:21:25,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 111 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-10-24 11:21:25,548 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:25,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 398 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:21:25,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-24 11:21:25,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2024-10-24 11:21:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 144 states have (on average 1.3333333333333333) internal successors, (192), 144 states have internal predecessors, (192), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:21:25,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 248 transitions. [2024-10-24 11:21:25,565 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 248 transitions. Word has length 114 [2024-10-24 11:21:25,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:25,566 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 248 transitions. [2024-10-24 11:21:25,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:25,567 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 248 transitions. [2024-10-24 11:21:25,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:21:25,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:25,569 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:25,578 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-10-24 11:21:25,769 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-10-24 11:21:25,770 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:25,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:25,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1580210315, now seen corresponding path program 1 times [2024-10-24 11:21:25,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:25,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131602319] [2024-10-24 11:21:25,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:25,775 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-10-24 11:21:25,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:25,780 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-10-24 11:21:25,781 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-10-24 11:21:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:25,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:21:25,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:26,420 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 15 [2024-10-24 11:21:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-24 11:21:26,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:21:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:26,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:26,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131602319] [2024-10-24 11:21:26,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131602319] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:21:26,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:21:26,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-24 11:21:26,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991985609] [2024-10-24 11:21:26,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:26,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:21:26,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:26,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:21:26,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:21:26,698 INFO L87 Difference]: Start difference. First operand 175 states and 248 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:26,824 INFO L93 Difference]: Finished difference Result 339 states and 479 transitions. [2024-10-24 11:21:26,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:21:26,825 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-10-24 11:21:26,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:26,829 INFO L225 Difference]: With dead ends: 339 [2024-10-24 11:21:26,831 INFO L226 Difference]: Without dead ends: 230 [2024-10-24 11:21:26,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:21:26,833 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 54 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:26,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 581 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:21:26,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-24 11:21:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 195. [2024-10-24 11:21:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 164 states have (on average 1.353658536585366) internal successors, (222), 164 states have internal predecessors, (222), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:21:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 278 transitions. [2024-10-24 11:21:26,868 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 278 transitions. Word has length 116 [2024-10-24 11:21:26,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:26,872 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 278 transitions. [2024-10-24 11:21:26,873 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:26,873 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 278 transitions. [2024-10-24 11:21:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:21:26,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:26,875 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:26,885 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 (6)] Ended with exit code 0 [2024-10-24 11:21:27,075 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-10-24 11:21:27,076 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:27,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:27,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1249587293, now seen corresponding path program 1 times [2024-10-24 11:21:27,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:27,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676711771] [2024-10-24 11:21:27,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:27,077 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-10-24 11:21:27,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:27,079 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-10-24 11:21:27,080 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-10-24 11:21:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:21:27,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:27,328 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:27,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:27,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:27,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676711771] [2024-10-24 11:21:27,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676711771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:27,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:27,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:21:27,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390503254] [2024-10-24 11:21:27,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:27,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:21:27,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:27,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:21:27,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:21:27,332 INFO L87 Difference]: Start difference. First operand 195 states and 278 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:27,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:27,402 INFO L93 Difference]: Finished difference Result 313 states and 445 transitions. [2024-10-24 11:21:27,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:21:27,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-10-24 11:21:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:27,404 INFO L225 Difference]: With dead ends: 313 [2024-10-24 11:21:27,404 INFO L226 Difference]: Without dead ends: 201 [2024-10-24 11:21:27,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:21:27,406 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:27,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:21:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-24 11:21:27,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2024-10-24 11:21:27,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 166 states have internal predecessors, (224), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:21:27,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 280 transitions. [2024-10-24 11:21:27,427 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 280 transitions. Word has length 117 [2024-10-24 11:21:27,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:27,428 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 280 transitions. [2024-10-24 11:21:27,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 280 transitions. [2024-10-24 11:21:27,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 11:21:27,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:27,429 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:27,439 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 (7)] Forceful destruction successful, exit code 0 [2024-10-24 11:21:27,630 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-10-24 11:21:27,630 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:27,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:27,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1615892429, now seen corresponding path program 1 times [2024-10-24 11:21:27,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:27,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672326025] [2024-10-24 11:21:27,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:27,632 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-10-24 11:21:27,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:27,635 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-10-24 11:21:27,636 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-10-24 11:21:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:27,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:21:27,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:27,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:27,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:27,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672326025] [2024-10-24 11:21:27,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672326025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:27,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:27,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:21:27,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661827617] [2024-10-24 11:21:27,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:27,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:21:27,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:27,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:21:27,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:21:27,869 INFO L87 Difference]: Start difference. First operand 197 states and 280 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:27,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:27,974 INFO L93 Difference]: Finished difference Result 313 states and 444 transitions. [2024-10-24 11:21:27,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:21:27,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-24 11:21:27,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:27,976 INFO L225 Difference]: With dead ends: 313 [2024-10-24 11:21:27,976 INFO L226 Difference]: Without dead ends: 200 [2024-10-24 11:21:27,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 115 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-10-24 11:21:27,977 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:27,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 395 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:21:27,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-24 11:21:27,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2024-10-24 11:21:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 168 states have (on average 1.3452380952380953) internal successors, (226), 168 states have internal predecessors, (226), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:21:27,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 282 transitions. [2024-10-24 11:21:27,993 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 282 transitions. Word has length 118 [2024-10-24 11:21:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:27,994 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 282 transitions. [2024-10-24 11:21:27,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:27,994 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 282 transitions. [2024-10-24 11:21:27,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 11:21:27,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:27,995 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:28,005 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 (8)] Ended with exit code 0 [2024-10-24 11:21:28,196 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-10-24 11:21:28,196 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:28,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:28,197 INFO L85 PathProgramCache]: Analyzing trace with hash 806545803, now seen corresponding path program 1 times [2024-10-24 11:21:28,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:28,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997214107] [2024-10-24 11:21:28,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:28,198 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-10-24 11:21:28,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:28,199 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-10-24 11:21:28,200 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-10-24 11:21:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:28,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:21:28,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:28,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:28,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:28,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997214107] [2024-10-24 11:21:28,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997214107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:28,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:28,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:21:28,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516205553] [2024-10-24 11:21:28,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:28,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:21:28,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:28,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:21:28,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:21:28,464 INFO L87 Difference]: Start difference. First operand 199 states and 282 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:28,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:28,609 INFO L93 Difference]: Finished difference Result 317 states and 448 transitions. [2024-10-24 11:21:28,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:21:28,609 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-24 11:21:28,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:28,611 INFO L225 Difference]: With dead ends: 317 [2024-10-24 11:21:28,611 INFO L226 Difference]: Without dead ends: 202 [2024-10-24 11:21:28,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:21:28,612 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:28,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 519 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:21:28,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-24 11:21:28,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2024-10-24 11:21:28,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 170 states have (on average 1.3411764705882352) internal successors, (228), 170 states have internal predecessors, (228), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:21:28,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 284 transitions. [2024-10-24 11:21:28,623 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 284 transitions. Word has length 118 [2024-10-24 11:21:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:28,623 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 284 transitions. [2024-10-24 11:21:28,624 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:28,624 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 284 transitions. [2024-10-24 11:21:28,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 11:21:28,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:28,625 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:28,634 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-10-24 11:21:28,825 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-10-24 11:21:28,826 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:28,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:28,827 INFO L85 PathProgramCache]: Analyzing trace with hash 863804105, now seen corresponding path program 1 times [2024-10-24 11:21:28,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:28,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680941541] [2024-10-24 11:21:28,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:28,828 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-10-24 11:21:28,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:28,831 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-10-24 11:21:28,834 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-10-24 11:21:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:29,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:21:29,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:29,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:29,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:29,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680941541] [2024-10-24 11:21:29,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680941541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:29,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:29,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:21:29,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438032669] [2024-10-24 11:21:29,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:29,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:21:29,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:29,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:21:29,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:21:29,113 INFO L87 Difference]: Start difference. First operand 201 states and 284 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:29,371 INFO L93 Difference]: Finished difference Result 321 states and 452 transitions. [2024-10-24 11:21:29,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:21:29,371 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-24 11:21:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:29,373 INFO L225 Difference]: With dead ends: 321 [2024-10-24 11:21:29,373 INFO L226 Difference]: Without dead ends: 204 [2024-10-24 11:21:29,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:21:29,375 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:29,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 644 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:21:29,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-24 11:21:29,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2024-10-24 11:21:29,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 172 states have (on average 1.3372093023255813) internal successors, (230), 172 states have internal predecessors, (230), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:21:29,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 286 transitions. [2024-10-24 11:21:29,386 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 286 transitions. Word has length 118 [2024-10-24 11:21:29,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:29,386 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 286 transitions. [2024-10-24 11:21:29,387 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:29,387 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 286 transitions. [2024-10-24 11:21:29,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 11:21:29,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:29,388 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:29,396 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 (10)] Ended with exit code 0 [2024-10-24 11:21:29,592 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-10-24 11:21:29,593 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:29,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:29,593 INFO L85 PathProgramCache]: Analyzing trace with hash 863863687, now seen corresponding path program 1 times [2024-10-24 11:21:29,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:29,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489750043] [2024-10-24 11:21:29,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:29,594 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-10-24 11:21:29,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:29,596 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-10-24 11:21:29,597 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-10-24 11:21:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:29,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 11:21:29,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:29,892 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 8 treesize of output 1 [2024-10-24 11:21:29,902 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 14 treesize of output 10 [2024-10-24 11:21:30,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-24 11:21:30,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-10-24 11:21:30,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:21:30,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 54 [2024-10-24 11:21:30,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:21:30,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 57 [2024-10-24 11:21:30,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:21:30,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 57 [2024-10-24 11:21:30,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:21:30,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 34 [2024-10-24 11:21:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-24 11:21:30,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:30,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:30,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489750043] [2024-10-24 11:21:30,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489750043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:30,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:30,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:21:30,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454606160] [2024-10-24 11:21:30,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:30,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:21:30,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:30,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:21:30,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:21:30,949 INFO L87 Difference]: Start difference. First operand 203 states and 286 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 11:21:33,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:33,381 INFO L93 Difference]: Finished difference Result 423 states and 592 transitions. [2024-10-24 11:21:33,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:21:33,382 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2024-10-24 11:21:33,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:33,384 INFO L225 Difference]: With dead ends: 423 [2024-10-24 11:21:33,384 INFO L226 Difference]: Without dead ends: 304 [2024-10-24 11:21:33,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:21:33,385 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 277 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:33,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1020 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 11:21:33,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-24 11:21:33,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2024-10-24 11:21:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 263 states have (on average 1.349809885931559) internal successors, (355), 264 states have internal predecessors, (355), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 11:21:33,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 423 transitions. [2024-10-24 11:21:33,403 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 423 transitions. Word has length 118 [2024-10-24 11:21:33,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:33,403 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 423 transitions. [2024-10-24 11:21:33,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 11:21:33,404 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 423 transitions. [2024-10-24 11:21:33,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:21:33,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:33,405 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:33,415 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-10-24 11:21:33,605 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-10-24 11:21:33,606 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:33,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:33,606 INFO L85 PathProgramCache]: Analyzing trace with hash 310824816, now seen corresponding path program 1 times [2024-10-24 11:21:33,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:33,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805348498] [2024-10-24 11:21:33,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:33,607 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-10-24 11:21:33,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:33,609 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-10-24 11:21:33,610 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-10-24 11:21:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:33,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:21:33,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-24 11:21:34,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:21:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:21:34,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:34,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805348498] [2024-10-24 11:21:34,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805348498] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:21:34,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:21:34,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-10-24 11:21:34,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318883274] [2024-10-24 11:21:34,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:34,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:21:34,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:34,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:21:34,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:21:34,278 INFO L87 Difference]: Start difference. First operand 301 states and 423 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:34,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:34,389 INFO L93 Difference]: Finished difference Result 589 states and 814 transitions. [2024-10-24 11:21:34,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:21:34,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-10-24 11:21:34,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:34,393 INFO L225 Difference]: With dead ends: 589 [2024-10-24 11:21:34,393 INFO L226 Difference]: Without dead ends: 366 [2024-10-24 11:21:34,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:21:34,395 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 120 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:34,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 476 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:21:34,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-24 11:21:34,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 286. [2024-10-24 11:21:34,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 248 states have (on average 1.3346774193548387) internal successors, (331), 249 states have internal predecessors, (331), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 11:21:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 399 transitions. [2024-10-24 11:21:34,413 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 399 transitions. Word has length 119 [2024-10-24 11:21:34,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:34,413 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 399 transitions. [2024-10-24 11:21:34,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:21:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 399 transitions. [2024-10-24 11:21:34,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 11:21:34,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:34,415 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:34,424 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 (12)] Ended with exit code 0 [2024-10-24 11:21:34,615 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-10-24 11:21:34,616 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:34,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:34,616 INFO L85 PathProgramCache]: Analyzing trace with hash -537574160, now seen corresponding path program 1 times [2024-10-24 11:21:34,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:34,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231408460] [2024-10-24 11:21:34,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:34,617 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-10-24 11:21:34,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:34,620 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-10-24 11:21:34,621 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-10-24 11:21:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:34,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 11:21:34,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:36,401 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 20 treesize of output 21 [2024-10-24 11:21:40,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:21:40,223 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 182 treesize of output 98 [2024-10-24 11:21:40,228 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 197 treesize of output 107 [2024-10-24 11:21:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-10-24 11:21:40,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:40,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:40,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231408460] [2024-10-24 11:21:40,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231408460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:40,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:40,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:21:40,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433265002] [2024-10-24 11:21:40,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:40,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:21:40,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:40,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:21:40,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:21:40,539 INFO L87 Difference]: Start difference. First operand 286 states and 399 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:21:47,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:21:50,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:21:51,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:51,079 INFO L93 Difference]: Finished difference Result 562 states and 775 transitions. [2024-10-24 11:21:51,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:21:51,085 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2024-10-24 11:21:51,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:51,089 INFO L225 Difference]: With dead ends: 562 [2024-10-24 11:21:51,089 INFO L226 Difference]: Without dead ends: 560 [2024-10-24 11:21:51,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:21:51,090 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 199 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:51,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 784 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2024-10-24 11:21:51,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-10-24 11:21:51,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 556. [2024-10-24 11:21:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 482 states have (on average 1.3257261410788381) internal successors, (639), 486 states have internal predecessors, (639), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 61 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-24 11:21:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 769 transitions. [2024-10-24 11:21:51,128 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 769 transitions. Word has length 120 [2024-10-24 11:21:51,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:51,132 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 769 transitions. [2024-10-24 11:21:51,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:21:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 769 transitions. [2024-10-24 11:21:51,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 11:21:51,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:51,134 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:51,145 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-10-24 11:21:51,334 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-10-24 11:21:51,335 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:51,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:51,336 INFO L85 PathProgramCache]: Analyzing trace with hash -537514578, now seen corresponding path program 1 times [2024-10-24 11:21:51,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:51,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133735038] [2024-10-24 11:21:51,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:51,336 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-10-24 11:21:51,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:51,339 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-10-24 11:21:51,341 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-10-24 11:21:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:51,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-24 11:21:51,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:51,681 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 8 treesize of output 1 [2024-10-24 11:21:51,688 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 1 [2024-10-24 11:21:51,694 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 1 [2024-10-24 11:21:51,701 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 14 treesize of output 10 [2024-10-24 11:21:51,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-10-24 11:21:51,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:21:51,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 40 treesize of output 27 [2024-10-24 11:21:51,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:21:51,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2024-10-24 11:21:52,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:21:52,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 59 [2024-10-24 11:21:52,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:21:52,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 98 treesize of output 40 [2024-10-24 11:21:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-10-24 11:21:52,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:52,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:52,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133735038] [2024-10-24 11:21:52,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133735038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:52,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:52,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:21:52,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877031289] [2024-10-24 11:21:52,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:52,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:21:52,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:52,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:21:52,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:21:52,439 INFO L87 Difference]: Start difference. First operand 556 states and 769 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 11:21:54,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:54,002 INFO L93 Difference]: Finished difference Result 1294 states and 1741 transitions. [2024-10-24 11:21:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:21:54,003 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2024-10-24 11:21:54,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:54,007 INFO L225 Difference]: With dead ends: 1294 [2024-10-24 11:21:54,007 INFO L226 Difference]: Without dead ends: 878 [2024-10-24 11:21:54,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:21:54,009 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 350 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:54,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 615 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 11:21:54,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-10-24 11:21:54,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 676. [2024-10-24 11:21:54,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 598 states have (on average 1.285953177257525) internal successors, (769), 602 states have internal predecessors, (769), 65 states have call successors, (65), 12 states have call predecessors, (65), 12 states have return successors, (65), 61 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-24 11:21:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 899 transitions. [2024-10-24 11:21:54,055 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 899 transitions. Word has length 120 [2024-10-24 11:21:54,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:54,056 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 899 transitions. [2024-10-24 11:21:54,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 11:21:54,056 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 899 transitions. [2024-10-24 11:21:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 11:21:54,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:54,058 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:54,068 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-10-24 11:21:54,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-10-24 11:21:54,258 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:54,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:54,259 INFO L85 PathProgramCache]: Analyzing trace with hash -480256276, now seen corresponding path program 1 times [2024-10-24 11:21:54,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:54,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228057030] [2024-10-24 11:21:54,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:54,259 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-10-24 11:21:54,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:54,261 INFO L229 MonitoredProcess]: Starting monitored process 15 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-10-24 11:21:54,262 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 (15)] Waiting until timeout for monitored process [2024-10-24 11:21:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:54,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 11:21:54,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:54,574 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-10-24 11:21:54,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-10-24 11:21:55,706 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 30 treesize of output 39 [2024-10-24 11:21:58,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:21:58,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 94 [2024-10-24 11:21:58,811 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 167 treesize of output 107 [2024-10-24 11:21:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-10-24 11:21:59,157 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:59,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:59,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228057030] [2024-10-24 11:21:59,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228057030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:59,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:59,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:21:59,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035914844] [2024-10-24 11:21:59,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:59,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:21:59,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:59,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:21:59,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:21:59,159 INFO L87 Difference]: Start difference. First operand 676 states and 899 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:22:06,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:22:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:06,950 INFO L93 Difference]: Finished difference Result 1845 states and 2433 transitions. [2024-10-24 11:22:06,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:22:06,956 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2024-10-24 11:22:06,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:06,965 INFO L225 Difference]: With dead ends: 1845 [2024-10-24 11:22:06,965 INFO L226 Difference]: Without dead ends: 1327 [2024-10-24 11:22:06,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:22:06,967 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 297 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:22:06,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 690 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-10-24 11:22:06,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2024-10-24 11:22:07,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1321. [2024-10-24 11:22:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1164 states have (on average 1.2774914089347078) internal successors, (1487), 1176 states have internal predecessors, (1487), 128 states have call successors, (128), 28 states have call predecessors, (128), 28 states have return successors, (128), 116 states have call predecessors, (128), 128 states have call successors, (128) [2024-10-24 11:22:07,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1743 transitions. [2024-10-24 11:22:07,075 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1743 transitions. Word has length 120 [2024-10-24 11:22:07,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:07,076 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1743 transitions. [2024-10-24 11:22:07,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:22:07,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1743 transitions. [2024-10-24 11:22:07,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 11:22:07,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:07,078 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:22:07,089 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 (15)] Ended with exit code 0 [2024-10-24 11:22:07,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-10-24 11:22:07,280 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:07,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:07,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1063496946, now seen corresponding path program 1 times [2024-10-24 11:22:07,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:22:07,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069228270] [2024-10-24 11:22:07,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:07,281 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-10-24 11:22:07,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:22:07,282 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-10-24 11:22:07,283 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-10-24 11:22:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:07,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:22:07,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:22:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-10-24 11:22:07,505 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:22:07,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:22:07,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069228270] [2024-10-24 11:22:07,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069228270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:07,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:07,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:22:07,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606610385] [2024-10-24 11:22:07,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:07,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:22:07,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:22:07,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:22:07,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:22:07,524 INFO L87 Difference]: Start difference. First operand 1321 states and 1743 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:22:07,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:07,668 INFO L93 Difference]: Finished difference Result 2475 states and 3254 transitions. [2024-10-24 11:22:07,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:22:07,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2024-10-24 11:22:07,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:07,674 INFO L225 Difference]: With dead ends: 2475 [2024-10-24 11:22:07,675 INFO L226 Difference]: Without dead ends: 1321 [2024-10-24 11:22:07,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 117 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-10-24 11:22:07,678 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:22:07,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 386 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:22:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2024-10-24 11:22:07,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2024-10-24 11:22:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1164 states have (on average 1.27233676975945) internal successors, (1481), 1176 states have internal predecessors, (1481), 128 states have call successors, (128), 28 states have call predecessors, (128), 28 states have return successors, (128), 116 states have call predecessors, (128), 128 states have call successors, (128) [2024-10-24 11:22:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1737 transitions. [2024-10-24 11:22:07,793 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1737 transitions. Word has length 120 [2024-10-24 11:22:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:07,793 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1737 transitions. [2024-10-24 11:22:07,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:22:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1737 transitions. [2024-10-24 11:22:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 11:22:07,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:07,796 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:22:07,807 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-10-24 11:22:08,000 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-10-24 11:22:08,001 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:08,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:08,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1473565340, now seen corresponding path program 1 times [2024-10-24 11:22:08,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:22:08,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413986444] [2024-10-24 11:22:08,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:08,002 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-10-24 11:22:08,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:22:08,005 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-10-24 11:22:08,006 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-10-24 11:22:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:08,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:22:08,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:22:08,327 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-10-24 11:22:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 8 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-10-24 11:22:08,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:22:08,640 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-10-24 11:22:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-24 11:22:08,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:22:08,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413986444] [2024-10-24 11:22:08,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413986444] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:22:08,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:22:08,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-24 11:22:08,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618509715] [2024-10-24 11:22:08,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:22:08,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:22:08,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:22:08,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:22:08,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:22:08,658 INFO L87 Difference]: Start difference. First operand 1321 states and 1737 transitions. Second operand has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2024-10-24 11:22:11,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:22:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:13,398 INFO L93 Difference]: Finished difference Result 2568 states and 3350 transitions. [2024-10-24 11:22:13,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:22:13,399 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 122 [2024-10-24 11:22:13,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:13,405 INFO L225 Difference]: With dead ends: 2568 [2024-10-24 11:22:13,405 INFO L226 Difference]: Without dead ends: 1351 [2024-10-24 11:22:13,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:22:13,408 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 120 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:22:13,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 697 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-24 11:22:13,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2024-10-24 11:22:13,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1311. [2024-10-24 11:22:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1154 states have (on average 1.2660311958405546) internal successors, (1461), 1166 states have internal predecessors, (1461), 128 states have call successors, (128), 28 states have call predecessors, (128), 28 states have return successors, (128), 116 states have call predecessors, (128), 128 states have call successors, (128) [2024-10-24 11:22:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1717 transitions. [2024-10-24 11:22:13,520 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1717 transitions. Word has length 122 [2024-10-24 11:22:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:13,520 INFO L471 AbstractCegarLoop]: Abstraction has 1311 states and 1717 transitions. [2024-10-24 11:22:13,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2024-10-24 11:22:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1717 transitions. [2024-10-24 11:22:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 11:22:13,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:13,524 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:22:13,532 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-10-24 11:22:13,724 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-10-24 11:22:13,725 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:13,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:13,726 INFO L85 PathProgramCache]: Analyzing trace with hash 63337590, now seen corresponding path program 1 times [2024-10-24 11:22:13,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:22:13,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946121681] [2024-10-24 11:22:13,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:13,726 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-10-24 11:22:13,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:22:13,728 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-10-24 11:22:13,730 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-10-24 11:22:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:14,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 11:22:14,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:22:15,836 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 20 treesize of output 21 [2024-10-24 11:22:19,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:22:19,913 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 182 treesize of output 98 [2024-10-24 11:22:19,919 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 195 treesize of output 105 [2024-10-24 11:22:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 142 proven. 30 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-24 11:22:20,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:22:24,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:22:24,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946121681] [2024-10-24 11:22:24,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946121681] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:22:24,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1640204660] [2024-10-24 11:22:24,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:24,838 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:22:24,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:22:24,839 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-10-24 11:22:24,840 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-10-24 11:22:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:25,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 11:22:25,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:22:26,258 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 1