./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-s_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-78.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 cc60dbcb40c1b152bb26088ff001d223dce864841f907f99b254c3b58eb0aa47 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:32:16,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:32:16,287 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:32:16,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:32:16,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:32:16,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:32:16,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:32:16,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:32:16,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:32:16,330 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:32:16,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:32:16,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:32:16,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:32:16,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:32:16,332 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:32:16,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:32:16,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:32:16,333 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:32:16,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:32:16,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:32:16,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:32:16,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:32:16,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:32:16,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:32:16,336 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:32:16,336 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:32:16,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:32:16,336 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:32:16,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:32:16,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:32:16,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:32:16,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:32:16,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:32:16,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:32:16,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:32:16,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:32:16,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:32:16,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:32:16,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:32:16,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:32:16,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:32:16,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:32:16,341 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 -> cc60dbcb40c1b152bb26088ff001d223dce864841f907f99b254c3b58eb0aa47 [2024-10-13 06:32:16,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:32:16,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:32:16,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:32:16,691 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:32:16,692 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:32:16,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-78.i [2024-10-13 06:32:18,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:32:18,636 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:32:18,637 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-78.i [2024-10-13 06:32:18,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6bdc4c1e/93516457334c4a56bc318bd71f5ead11/FLAGcf80f3d90 [2024-10-13 06:32:18,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6bdc4c1e/93516457334c4a56bc318bd71f5ead11 [2024-10-13 06:32:18,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:32:18,671 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:32:18,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:32:18,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:32:18,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:32:18,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:32:18" (1/1) ... [2024-10-13 06:32:18,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87a0896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:18, skipping insertion in model container [2024-10-13 06:32:18,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:32:18" (1/1) ... [2024-10-13 06:32:18,716 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:32:18,895 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-s_file-78.i[916,929] [2024-10-13 06:32:18,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:32:18,953 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:32:18,965 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-s_file-78.i[916,929] [2024-10-13 06:32:18,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:32:19,020 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:32:19,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:19 WrapperNode [2024-10-13 06:32:19,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:32:19,022 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:32:19,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:32:19,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:32:19,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:19" (1/1) ... [2024-10-13 06:32:19,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:19" (1/1) ... [2024-10-13 06:32:19,083 INFO L138 Inliner]: procedures = 29, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 411 [2024-10-13 06:32:19,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:32:19,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:32:19,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:32:19,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:32:19,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:19" (1/1) ... [2024-10-13 06:32:19,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:19" (1/1) ... [2024-10-13 06:32:19,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:19" (1/1) ... [2024-10-13 06:32:19,118 INFO L175 MemorySlicer]: Split 110 memory accesses to 2 slices as follows [2, 108]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 15 writes are split as follows [0, 15]. [2024-10-13 06:32:19,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:19" (1/1) ... [2024-10-13 06:32:19,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:19" (1/1) ... [2024-10-13 06:32:19,135 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:19" (1/1) ... [2024-10-13 06:32:19,139 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:19" (1/1) ... [2024-10-13 06:32:19,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:19" (1/1) ... [2024-10-13 06:32:19,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:19" (1/1) ... [2024-10-13 06:32:19,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:32:19,161 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:32:19,161 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:32:19,162 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:32:19,163 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:19" (1/1) ... [2024-10-13 06:32:19,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:32:19,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:32:19,205 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-13 06:32:19,210 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-13 06:32:19,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:32:19,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:32:19,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:32:19,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:32:19,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:32:19,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:32:19,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:32:19,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:32:19,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:32:19,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:32:19,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:32:19,255 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:32:19,255 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:32:19,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:32:19,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:32:19,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:32:19,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:32:19,397 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:32:19,399 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:32:19,926 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2024-10-13 06:32:19,926 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:32:20,029 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:32:20,030 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:32:20,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:32:20 BoogieIcfgContainer [2024-10-13 06:32:20,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:32:20,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:32:20,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:32:20,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:32:20,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:32:18" (1/3) ... [2024-10-13 06:32:20,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1d8e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:32:20, skipping insertion in model container [2024-10-13 06:32:20,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:19" (2/3) ... [2024-10-13 06:32:20,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1d8e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:32:20, skipping insertion in model container [2024-10-13 06:32:20,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:32:20" (3/3) ... [2024-10-13 06:32:20,044 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-78.i [2024-10-13 06:32:20,065 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:32:20,065 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:32:20,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:32:20,131 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;@35ee93db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:32:20,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:32:20,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 74 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:32:20,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 06:32:20,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:20,151 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:32:20,153 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:20,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:20,159 INFO L85 PathProgramCache]: Analyzing trace with hash 315096233, now seen corresponding path program 1 times [2024-10-13 06:32:20,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:20,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067622974] [2024-10-13 06:32:20,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:20,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:20,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:20,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:20,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:20,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:20,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:32:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:20,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:32:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:20,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:32:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:20,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:32:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:20,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:32:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:20,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:32:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 06:32:20,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:20,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067622974] [2024-10-13 06:32:20,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067622974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:20,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:20,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:32:20,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270758343] [2024-10-13 06:32:20,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:20,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:32:20,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:20,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:32:20,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:32:20,622 INFO L87 Difference]: Start difference. First operand has 86 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 74 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 06:32:20,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:20,667 INFO L93 Difference]: Finished difference Result 169 states and 266 transitions. [2024-10-13 06:32:20,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:32:20,670 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2024-10-13 06:32:20,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:20,681 INFO L225 Difference]: With dead ends: 169 [2024-10-13 06:32:20,682 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 06:32:20,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:32:20,692 INFO L432 NwaCegarLoop]: 120 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, 120 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-13 06:32:20,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:32:20,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 06:32:20,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 06:32:20,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 72 states have internal predecessors, (104), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:32:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2024-10-13 06:32:20,745 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 93 [2024-10-13 06:32:20,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:20,746 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2024-10-13 06:32:20,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 06:32:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2024-10-13 06:32:20,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 06:32:20,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:20,753 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:32:20,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:32:20,754 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:20,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:20,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2034445749, now seen corresponding path program 1 times [2024-10-13 06:32:20,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:20,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599719141] [2024-10-13 06:32:20,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:20,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:32:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:32:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:32:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:32:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:32:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:32:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 06:32:21,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:21,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599719141] [2024-10-13 06:32:21,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599719141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:21,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:21,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:32:21,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459756642] [2024-10-13 06:32:21,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:21,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:32:21,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:21,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:32:21,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:32:21,100 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 06:32:21,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:21,153 INFO L93 Difference]: Finished difference Result 169 states and 250 transitions. [2024-10-13 06:32:21,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:32:21,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2024-10-13 06:32:21,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:21,158 INFO L225 Difference]: With dead ends: 169 [2024-10-13 06:32:21,158 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 06:32:21,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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-13 06:32:21,160 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 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-13 06:32:21,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:32:21,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 06:32:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-13 06:32:21,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 74 states have internal predecessors, (106), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:32:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 126 transitions. [2024-10-13 06:32:21,182 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 126 transitions. Word has length 93 [2024-10-13 06:32:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:21,183 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 126 transitions. [2024-10-13 06:32:21,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 06:32:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 126 transitions. [2024-10-13 06:32:21,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 06:32:21,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:21,185 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:32:21,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:32:21,186 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:21,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:21,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2049964467, now seen corresponding path program 1 times [2024-10-13 06:32:21,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:21,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966540080] [2024-10-13 06:32:21,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:21,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:32:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:32:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:32:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:32:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:32:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:32:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 06:32:21,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:21,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966540080] [2024-10-13 06:32:21,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966540080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:21,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:21,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:32:21,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149155882] [2024-10-13 06:32:21,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:21,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:32:21,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:21,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:32:21,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:32:21,519 INFO L87 Difference]: Start difference. First operand 86 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 06:32:21,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:21,577 INFO L93 Difference]: Finished difference Result 173 states and 254 transitions. [2024-10-13 06:32:21,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:32:21,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 93 [2024-10-13 06:32:21,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:21,582 INFO L225 Difference]: With dead ends: 173 [2024-10-13 06:32:21,585 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 06:32:21,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 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-13 06:32:21,587 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 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-13 06:32:21,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:32:21,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 06:32:21,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-13 06:32:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:32:21,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-10-13 06:32:21,606 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 93 [2024-10-13 06:32:21,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:21,607 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-10-13 06:32:21,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 06:32:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-10-13 06:32:21,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 06:32:21,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:21,611 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:32:21,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:32:21,612 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:21,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:21,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2147080840, now seen corresponding path program 1 times [2024-10-13 06:32:21,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:21,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476271987] [2024-10-13 06:32:21,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:21,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:22,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:22,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:22,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:22,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:22,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:32:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:22,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:32:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:22,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:32:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:22,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:32:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:22,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:32:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:22,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:32:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:22,780 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 06:32:22,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:22,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476271987] [2024-10-13 06:32:22,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476271987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:22,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:22,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:32:22,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776078994] [2024-10-13 06:32:22,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:22,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:32:22,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:22,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:32:22,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:32:22,785 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 06:32:23,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:23,071 INFO L93 Difference]: Finished difference Result 262 states and 382 transitions. [2024-10-13 06:32:23,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:32:23,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 95 [2024-10-13 06:32:23,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:23,075 INFO L225 Difference]: With dead ends: 262 [2024-10-13 06:32:23,075 INFO L226 Difference]: Without dead ends: 175 [2024-10-13 06:32:23,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:32:23,077 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 79 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:23,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 196 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:32:23,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-13 06:32:23,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2024-10-13 06:32:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 149 states have (on average 1.4161073825503356) internal successors, (211), 149 states have internal predecessors, (211), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:32:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 251 transitions. [2024-10-13 06:32:23,101 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 251 transitions. Word has length 95 [2024-10-13 06:32:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:23,102 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 251 transitions. [2024-10-13 06:32:23,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 06:32:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 251 transitions. [2024-10-13 06:32:23,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 06:32:23,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:23,109 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:32:23,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:32:23,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:23,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:23,110 INFO L85 PathProgramCache]: Analyzing trace with hash 868022778, now seen corresponding path program 1 times [2024-10-13 06:32:23,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:23,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240335068] [2024-10-13 06:32:23,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:23,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:23,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:23,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:23,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:23,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:23,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:32:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:23,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:32:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:23,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:32:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:23,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:32:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:23,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:32:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:23,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:32:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 06:32:23,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:23,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240335068] [2024-10-13 06:32:23,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240335068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:23,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:23,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:32:23,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038745034] [2024-10-13 06:32:23,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:23,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:32:23,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:23,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:32:23,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:32:23,399 INFO L87 Difference]: Start difference. First operand 172 states and 251 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 06:32:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:23,535 INFO L93 Difference]: Finished difference Result 397 states and 578 transitions. [2024-10-13 06:32:23,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:32:23,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 95 [2024-10-13 06:32:23,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:23,539 INFO L225 Difference]: With dead ends: 397 [2024-10-13 06:32:23,539 INFO L226 Difference]: Without dead ends: 226 [2024-10-13 06:32:23,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:32:23,540 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 66 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:23,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 301 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:32:23,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-13 06:32:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 190. [2024-10-13 06:32:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 167 states have (on average 1.4191616766467066) internal successors, (237), 167 states have internal predecessors, (237), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:32:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 277 transitions. [2024-10-13 06:32:23,554 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 277 transitions. Word has length 95 [2024-10-13 06:32:23,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:23,555 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 277 transitions. [2024-10-13 06:32:23,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 06:32:23,555 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 277 transitions. [2024-10-13 06:32:23,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 06:32:23,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:23,557 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:32:23,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:32:23,557 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:23,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:23,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1454828792, now seen corresponding path program 1 times [2024-10-13 06:32:23,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:23,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225502434] [2024-10-13 06:32:23,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:23,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:32:23,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:32:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:32:23,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:32:23,696 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:32:23,697 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:32:23,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:32:23,702 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 06:32:23,760 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:32:23,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:32:23 BoogieIcfgContainer [2024-10-13 06:32:23,763 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:32:23,764 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:32:23,764 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:32:23,764 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:32:23,764 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:32:20" (3/4) ... [2024-10-13 06:32:23,766 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:32:23,768 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:32:23,768 INFO L158 Benchmark]: Toolchain (without parser) took 5097.68ms. Allocated memory was 209.7MB in the beginning and 333.4MB in the end (delta: 123.7MB). Free memory was 139.6MB in the beginning and 298.6MB in the end (delta: -158.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:32:23,769 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:32:23,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.40ms. Allocated memory is still 209.7MB. Free memory was 139.6MB in the beginning and 123.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 06:32:23,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.31ms. Allocated memory is still 209.7MB. Free memory was 123.1MB in the beginning and 119.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:32:23,769 INFO L158 Benchmark]: Boogie Preprocessor took 75.92ms. Allocated memory is still 209.7MB. Free memory was 119.7MB in the beginning and 115.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:32:23,770 INFO L158 Benchmark]: RCFGBuilder took 871.86ms. Allocated memory is still 209.7MB. Free memory was 115.2MB in the beginning and 171.9MB in the end (delta: -56.7MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2024-10-13 06:32:23,770 INFO L158 Benchmark]: TraceAbstraction took 3726.80ms. Allocated memory was 209.7MB in the beginning and 333.4MB in the end (delta: 123.7MB). Free memory was 171.9MB in the beginning and 298.6MB in the end (delta: -126.7MB). Peak memory consumption was 156.4MB. Max. memory is 16.1GB. [2024-10-13 06:32:23,770 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 333.4MB. Free memory is still 298.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:32:23,772 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.13ms. Allocated memory is still 125.8MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.40ms. Allocated memory is still 209.7MB. Free memory was 139.6MB in the beginning and 123.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.31ms. Allocated memory is still 209.7MB. Free memory was 123.1MB in the beginning and 119.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.92ms. Allocated memory is still 209.7MB. Free memory was 119.7MB in the beginning and 115.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 871.86ms. Allocated memory is still 209.7MB. Free memory was 115.2MB in the beginning and 171.9MB in the end (delta: -56.7MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3726.80ms. Allocated memory was 209.7MB in the beginning and 333.4MB in the end (delta: 123.7MB). Free memory was 171.9MB in the beginning and 298.6MB in the end (delta: -126.7MB). Peak memory consumption was 156.4MB. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 333.4MB. Free memory is still 298.6MB. 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 102, overapproximation of someBinaryArithmeticDOUBLEoperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryArithmeticFLOAToperation at line 65. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L81] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L82] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L86] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L88] EXPR WrapperStruct00.var_1_10 [L88] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L88] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L88] EXPR WrapperStruct00.var_1_10 [L88] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L88] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L90] EXPR WrapperStruct00.var_1_11 [L90] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_11 [L90] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L92] EXPR WrapperStruct00.var_1_13 [L92] EXPR WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 <= -1.0e-20F [L92] EXPR WrapperStruct00.var_1_13 [L92] EXPR WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR (WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR (WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L94] EXPR WrapperStruct00.var_1_14 [L94] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_14 [L94] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] RET updateVariables() [L111] CALL step() [L52] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L52] COND TRUE 0.8f > (- WrapperStruct00.var_1_10) [L53] EXPR WrapperStruct00.var_1_16 [L53] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L55] EXPR WrapperStruct00.var_1_15 [L55] EXPR WrapperStruct00.var_1_15 [L55] unsigned char stepLocal_1 = WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15; [L56] EXPR WrapperStruct00.var_1_3 [L56] unsigned char stepLocal_0 = WrapperStruct00.var_1_3; [L57] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L57] COND FALSE !(WrapperStruct00.var_1_2 && stepLocal_0) [L64] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L64] COND TRUE WrapperStruct00.var_1_2 [L65] EXPR WrapperStruct00.var_1_10 [L65] EXPR WrapperStruct00.var_1_11 [L65] WrapperStruct00.var_1_9 = (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11) [L73] EXPR WrapperStruct00.var_1_1 [L73] signed long int stepLocal_2 = WrapperStruct00.var_1_1; [L74] COND FALSE !(stepLocal_2 <= ((((8u) < 0 ) ? -(8u) : (8u)))) [L77] EXPR WrapperStruct00.var_1_13 [L77] EXPR WrapperStruct00.var_1_14 [L77] EXPR WrapperStruct00.var_1_11 [L77] WrapperStruct00.var_1_12 = ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_11) [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR WrapperStruct00.var_1_2 [L102] EXPR WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3 [L102] EXPR WrapperStruct00.var_1_3 [L102] EXPR WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1 [L102] EXPR (WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10)))) [L102] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))) [L102] EXPR WrapperStruct00.var_1_9 [L102] EXPR WrapperStruct00.var_1_10 [L102] EXPR WrapperStruct00.var_1_11 [L102] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))))) && ((WrapperStruct00.var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_10 - 99.5))) : (WrapperStruct00.var_1_12 == ((double) ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_11)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))))) && ((WrapperStruct00.var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_10 - 99.5))) : (WrapperStruct00.var_1_12 == ((double) ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_11)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR ((((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))))) && ((WrapperStruct00.var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_10 - 99.5))) : (WrapperStruct00.var_1_12 == ((double) ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_11))))) && ((0.8f > (- WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR ((((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))))) && ((WrapperStruct00.var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_10 - 99.5))) : (WrapperStruct00.var_1_12 == ((double) ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_11))))) && ((0.8f > (- WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L102-L103] return ((((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))))) && ((WrapperStruct00.var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_10 - 99.5))) : (WrapperStruct00.var_1_12 == ((double) ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_11))))) && ((0.8f > (- WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 1311 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 769 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 332 IncrementalHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 542 mSDtfsCounter, 332 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=5, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 39 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 564 NumberOfCodeBlocks, 564 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 464 ConstructedInterpolants, 0 QuantifiedInterpolants, 839 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 900/900 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-13 06:32:23,808 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-s_file-78.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 cc60dbcb40c1b152bb26088ff001d223dce864841f907f99b254c3b58eb0aa47 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:32:26,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:32:26,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:32:26,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:32:26,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:32:26,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:32:26,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:32:26,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:32:26,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:32:26,633 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:32:26,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:32:26,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:32:26,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:32:26,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:32:26,635 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:32:26,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:32:26,636 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:32:26,636 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:32:26,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:32:26,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:32:26,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:32:26,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:32:26,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:32:26,641 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:32:26,641 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:32:26,641 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:32:26,642 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:32:26,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:32:26,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:32:26,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:32:26,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:32:26,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:32:26,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:32:26,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:32:26,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:32:26,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:32:26,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:32:26,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:32:26,651 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:32:26,651 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:32:26,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:32:26,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:32:26,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:32:26,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:32:26,653 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:32:26,653 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 -> cc60dbcb40c1b152bb26088ff001d223dce864841f907f99b254c3b58eb0aa47 [2024-10-13 06:32:27,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:32:27,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:32:27,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:32:27,058 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:32:27,058 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:32:27,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-78.i [2024-10-13 06:32:28,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:32:29,065 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:32:29,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-78.i [2024-10-13 06:32:29,073 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1dce58d/ec9a0baa2922462e91e4e54783337f3f/FLAG2923a639a [2024-10-13 06:32:29,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1dce58d/ec9a0baa2922462e91e4e54783337f3f [2024-10-13 06:32:29,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:32:29,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:32:29,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:32:29,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:32:29,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:32:29,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:32:29" (1/1) ... [2024-10-13 06:32:29,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41fa67de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:29, skipping insertion in model container [2024-10-13 06:32:29,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:32:29" (1/1) ... [2024-10-13 06:32:29,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:32:29,679 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-s_file-78.i[916,929] [2024-10-13 06:32:29,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:32:29,778 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:32:29,791 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-s_file-78.i[916,929] [2024-10-13 06:32:29,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:32:29,886 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:32:29,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:29 WrapperNode [2024-10-13 06:32:29,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:32:29,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:32:29,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:32:29,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:32:29,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:29" (1/1) ... [2024-10-13 06:32:29,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:29" (1/1) ... [2024-10-13 06:32:29,971 INFO L138 Inliner]: procedures = 36, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 411 [2024-10-13 06:32:29,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:32:29,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:32:29,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:32:29,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:32:29,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:29" (1/1) ... [2024-10-13 06:32:29,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:29" (1/1) ... [2024-10-13 06:32:29,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:29" (1/1) ... [2024-10-13 06:32:30,045 INFO L175 MemorySlicer]: Split 110 memory accesses to 2 slices as follows [2, 108]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 15 writes are split as follows [0, 15]. [2024-10-13 06:32:30,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:29" (1/1) ... [2024-10-13 06:32:30,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:29" (1/1) ... [2024-10-13 06:32:30,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:29" (1/1) ... [2024-10-13 06:32:30,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:29" (1/1) ... [2024-10-13 06:32:30,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:29" (1/1) ... [2024-10-13 06:32:30,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:29" (1/1) ... [2024-10-13 06:32:30,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:32:30,132 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:32:30,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:32:30,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:32:30,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:29" (1/1) ... [2024-10-13 06:32:30,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:32:30,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:32:30,176 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-13 06:32:30,184 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-13 06:32:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:32:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-13 06:32:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-13 06:32:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-13 06:32:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-13 06:32:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:32:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:32:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:32:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:32:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 06:32:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 06:32:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 06:32:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 06:32:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-13 06:32:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-13 06:32:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 06:32:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 06:32:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 06:32:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 06:32:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 06:32:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 06:32:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:32:30,236 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:32:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:32:30,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:32:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:32:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:32:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 06:32:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 06:32:30,386 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:32:30,388 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:32:36,900 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-10-13 06:32:36,901 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:32:36,994 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:32:36,995 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:32:36,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:32:36 BoogieIcfgContainer [2024-10-13 06:32:36,995 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:32:37,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:32:37,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:32:37,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:32:37,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:32:29" (1/3) ... [2024-10-13 06:32:37,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1395c260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:32:37, skipping insertion in model container [2024-10-13 06:32:37,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:29" (2/3) ... [2024-10-13 06:32:37,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1395c260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:32:37, skipping insertion in model container [2024-10-13 06:32:37,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:32:36" (3/3) ... [2024-10-13 06:32:37,010 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-78.i [2024-10-13 06:32:37,030 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:32:37,030 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:32:37,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:32:37,115 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;@6dad64ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:32:37,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:32:37,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 74 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:32:37,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 06:32:37,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:37,134 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:32:37,135 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:37,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:37,141 INFO L85 PathProgramCache]: Analyzing trace with hash 315096233, now seen corresponding path program 1 times [2024-10-13 06:32:37,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:32:37,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060591056] [2024-10-13 06:32:37,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:37,159 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-13 06:32:37,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:32:37,163 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-13 06:32:37,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 06:32:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:37,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:32:37,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:32:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-13 06:32:37,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:32:37,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:32:37,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060591056] [2024-10-13 06:32:37,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060591056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:37,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:37,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:32:37,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101448773] [2024-10-13 06:32:37,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:37,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:32:37,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:32:37,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:32:37,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:32:37,734 INFO L87 Difference]: Start difference. First operand has 86 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 74 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 06:32:37,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:37,816 INFO L93 Difference]: Finished difference Result 169 states and 266 transitions. [2024-10-13 06:32:37,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:32:37,821 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2024-10-13 06:32:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:37,831 INFO L225 Difference]: With dead ends: 169 [2024-10-13 06:32:37,832 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 06:32:37,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-13 06:32:37,845 INFO L432 NwaCegarLoop]: 120 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, 120 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-13 06:32:37,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:32:37,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 06:32:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 06:32:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 72 states have internal predecessors, (104), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:32:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2024-10-13 06:32:37,907 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 93 [2024-10-13 06:32:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:37,909 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2024-10-13 06:32:37,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 06:32:37,909 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2024-10-13 06:32:37,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 06:32:37,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:37,916 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:32:37,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 06:32:38,120 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-13 06:32:38,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:38,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:38,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2034445749, now seen corresponding path program 1 times [2024-10-13 06:32:38,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:32:38,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544439288] [2024-10-13 06:32:38,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:38,124 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-13 06:32:38,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:32:38,128 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-13 06:32:38,137 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-13 06:32:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:32:38,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:32:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:32:38,582 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:32:38,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:32:38,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544439288] [2024-10-13 06:32:38,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544439288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:38,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:38,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:32:38,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552566778] [2024-10-13 06:32:38,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:38,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:32:38,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:32:38,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:32:38,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:32:38,587 INFO L87 Difference]: Start difference. First operand 84 states and 124 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 06:32:38,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:38,775 INFO L93 Difference]: Finished difference Result 169 states and 250 transitions. [2024-10-13 06:32:38,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:32:38,775 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2024-10-13 06:32:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:38,777 INFO L225 Difference]: With dead ends: 169 [2024-10-13 06:32:38,777 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 06:32:38,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 90 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-13 06:32:38,778 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:38,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:32:38,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 06:32:38,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-13 06:32:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 74 states have internal predecessors, (106), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:32:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 126 transitions. [2024-10-13 06:32:38,789 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 126 transitions. Word has length 93 [2024-10-13 06:32:38,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:38,790 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 126 transitions. [2024-10-13 06:32:38,790 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 06:32:38,791 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 126 transitions. [2024-10-13 06:32:38,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 06:32:38,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:38,793 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:32:38,809 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-13 06:32:38,997 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-13 06:32:38,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:39,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:39,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2049964467, now seen corresponding path program 1 times [2024-10-13 06:32:39,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:32:39,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292308965] [2024-10-13 06:32:39,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:39,001 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-13 06:32:39,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:32:39,003 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-13 06:32:39,005 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-13 06:32:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:32:39,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:32:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 06:32:39,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:32:39,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:32:39,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292308965] [2024-10-13 06:32:39,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292308965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:39,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:39,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:32:39,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449187726] [2024-10-13 06:32:39,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:39,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:32:39,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:32:39,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:32:39,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:32:39,430 INFO L87 Difference]: Start difference. First operand 86 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 06:32:39,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:39,534 INFO L93 Difference]: Finished difference Result 173 states and 254 transitions. [2024-10-13 06:32:39,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:32:39,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 93 [2024-10-13 06:32:39,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:39,540 INFO L225 Difference]: With dead ends: 173 [2024-10-13 06:32:39,540 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 06:32:39,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 90 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-13 06:32:39,542 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 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-13 06:32:39,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:32:39,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 06:32:39,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-13 06:32:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:32:39,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-10-13 06:32:39,557 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 93 [2024-10-13 06:32:39,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:39,559 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-10-13 06:32:39,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 06:32:39,559 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-10-13 06:32:39,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 06:32:39,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:39,562 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:32:39,585 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-13 06:32:39,762 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-13 06:32:39,763 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:39,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:39,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2147080840, now seen corresponding path program 1 times [2024-10-13 06:32:39,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:32:39,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706182496] [2024-10-13 06:32:39,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:39,764 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-13 06:32:39,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:32:39,768 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-13 06:32:39,773 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-13 06:32:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:40,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:32:40,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:32:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 06:32:40,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:32:40,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:32:40,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706182496] [2024-10-13 06:32:40,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706182496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:40,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:40,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:32:40,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476311342] [2024-10-13 06:32:40,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:40,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:32:40,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:32:40,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:32:40,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:32:40,306 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 06:32:43,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:32:48,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:32:50,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:32:50,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:50,914 INFO L93 Difference]: Finished difference Result 198 states and 286 transitions. [2024-10-13 06:32:50,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:32:50,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 95 [2024-10-13 06:32:50,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:50,917 INFO L225 Difference]: With dead ends: 198 [2024-10-13 06:32:50,917 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 06:32:50,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:32:50,919 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 27 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:50,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 383 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2024-10-13 06:32:50,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 06:32:50,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 92. [2024-10-13 06:32:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:32:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2024-10-13 06:32:50,927 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 95 [2024-10-13 06:32:50,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:50,927 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2024-10-13 06:32:50,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 06:32:50,928 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2024-10-13 06:32:50,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 06:32:50,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:50,929 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:32:50,942 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 (5)] Forceful destruction successful, exit code 0 [2024-10-13 06:32:51,133 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-13 06:32:51,134 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:51,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:51,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1560274826, now seen corresponding path program 1 times [2024-10-13 06:32:51,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:32:51,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452439168] [2024-10-13 06:32:51,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:51,136 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-13 06:32:51,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:32:51,139 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-13 06:32:51,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 06:32:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:51,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 06:32:51,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:32:51,596 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 95 treesize of output 41 [2024-10-13 06:32:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:32:51,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:32:51,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:32:51,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452439168] [2024-10-13 06:32:51,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452439168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:51,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:51,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:32:51,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087085957] [2024-10-13 06:32:51,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:51,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:32:51,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:32:51,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:32:51,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:32:51,642 INFO L87 Difference]: Start difference. First operand 92 states and 132 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 06:32:54,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:32:57,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:32:57,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:57,594 INFO L93 Difference]: Finished difference Result 184 states and 264 transitions. [2024-10-13 06:32:57,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:32:57,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 95 [2024-10-13 06:32:57,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:57,596 INFO L225 Difference]: With dead ends: 184 [2024-10-13 06:32:57,596 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 06:32:57,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:32:57,597 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 106 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:57,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 315 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-10-13 06:32:57,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 06:32:57,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-13 06:32:57,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:32:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2024-10-13 06:32:57,610 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 95 [2024-10-13 06:32:57,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:57,610 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2024-10-13 06:32:57,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 06:32:57,610 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2024-10-13 06:32:57,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-13 06:32:57,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:57,612 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:57,630 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-13 06:32:57,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:32:57,816 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:57,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:57,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1107366714, now seen corresponding path program 1 times [2024-10-13 06:32:57,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:32:57,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766399453] [2024-10-13 06:32:57,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:57,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:32:57,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:32:57,819 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:32:57,822 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-13 06:32:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:58,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:32:58,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:32:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-13 06:32:58,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:32:58,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:32:58,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766399453] [2024-10-13 06:32:58,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766399453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:58,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:58,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:32:58,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866080647] [2024-10-13 06:32:58,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:58,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:32:58,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:32:58,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:32:58,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:32:58,295 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-13 06:32:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:58,500 INFO L93 Difference]: Finished difference Result 187 states and 266 transitions. [2024-10-13 06:32:58,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:32:58,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 97 [2024-10-13 06:32:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:58,504 INFO L225 Difference]: With dead ends: 187 [2024-10-13 06:32:58,505 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 06:32:58,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 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-13 06:32:58,506 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:58,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 502 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:32:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 06:32:58,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2024-10-13 06:32:58,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:32:58,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2024-10-13 06:32:58,518 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 97 [2024-10-13 06:32:58,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:58,519 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2024-10-13 06:32:58,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-13 06:32:58,519 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2024-10-13 06:32:58,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-13 06:32:58,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:58,520 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:58,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 06:32:58,723 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-13 06:32:58,724 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:58,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:58,725 INFO L85 PathProgramCache]: Analyzing trace with hash 153426556, now seen corresponding path program 1 times [2024-10-13 06:32:58,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:32:58,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513754244] [2024-10-13 06:32:58,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:58,725 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-13 06:32:58,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:32:58,728 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-13 06:32:58,729 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-13 06:32:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:59,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 06:32:59,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:32:59,163 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 95 treesize of output 41 [2024-10-13 06:32:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-13 06:32:59,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:32:59,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:32:59,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513754244] [2024-10-13 06:32:59,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513754244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:59,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:59,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:32:59,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988948296] [2024-10-13 06:32:59,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:59,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:32:59,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:32:59,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:32:59,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:32:59,195 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 06:33:02,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:33:07,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:33:07,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:07,182 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2024-10-13 06:33:07,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:33:07,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 97 [2024-10-13 06:33:07,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:07,184 INFO L225 Difference]: With dead ends: 184 [2024-10-13 06:33:07,185 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 06:33:07,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:33:07,186 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 97 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:07,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 309 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2024-10-13 06:33:07,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 06:33:07,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-13 06:33:07,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:33:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2024-10-13 06:33:07,203 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 97 [2024-10-13 06:33:07,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:07,203 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-10-13 06:33:07,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 06:33:07,203 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2024-10-13 06:33:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 06:33:07,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:07,204 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:33:07,229 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-13 06:33:07,405 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-13 06:33:07,406 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:07,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:07,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1929104438, now seen corresponding path program 1 times [2024-10-13 06:33:07,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:07,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224033022] [2024-10-13 06:33:07,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:07,409 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-13 06:33:07,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:07,410 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-13 06:33:07,412 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-13 06:33:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:07,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 06:33:07,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:08,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:08,038 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 175 treesize of output 67 [2024-10-13 06:33:08,102 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 06:33:08,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:08,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:08,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224033022] [2024-10-13 06:33:08,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224033022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:08,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:08,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:33:08,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004318194] [2024-10-13 06:33:08,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:08,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:33:08,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:08,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:33:08,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:33:08,106 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 06:33:11,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:33:13,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:33:13,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:13,337 INFO L93 Difference]: Finished difference Result 183 states and 257 transitions. [2024-10-13 06:33:13,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:33:13,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2024-10-13 06:33:13,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:13,340 INFO L225 Difference]: With dead ends: 183 [2024-10-13 06:33:13,340 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 06:33:13,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:33:13,340 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 89 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:13,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 306 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-13 06:33:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 06:33:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2024-10-13 06:33:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.358974358974359) internal successors, (106), 78 states have internal predecessors, (106), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:33:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2024-10-13 06:33:13,349 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 99 [2024-10-13 06:33:13,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:13,350 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2024-10-13 06:33:13,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 06:33:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2024-10-13 06:33:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:33:13,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:13,351 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:33:13,382 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 (9)] Ended with exit code 0 [2024-10-13 06:33:13,557 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-13 06:33:13,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:13,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:13,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1983951678, now seen corresponding path program 1 times [2024-10-13 06:33:13,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:13,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842585688] [2024-10-13 06:33:13,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:13,561 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-13 06:33:13,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:13,563 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-13 06:33:13,563 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-13 06:33:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:13,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 06:33:13,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:14,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:14,053 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 173 treesize of output 65 [2024-10-13 06:33:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-13 06:33:14,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:14,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:14,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842585688] [2024-10-13 06:33:14,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842585688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:14,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:14,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:33:14,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29116975] [2024-10-13 06:33:14,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:14,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:33:14,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:14,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:33:14,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:33:14,093 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 06:33:17,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:33:20,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:33:20,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:20,188 INFO L93 Difference]: Finished difference Result 180 states and 252 transitions. [2024-10-13 06:33:20,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:33:20,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2024-10-13 06:33:20,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:20,189 INFO L225 Difference]: With dead ends: 180 [2024-10-13 06:33:20,190 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 06:33:20,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:33:20,192 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 78 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:20,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 300 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-10-13 06:33:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 06:33:20,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-13 06:33:20,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:33:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2024-10-13 06:33:20,203 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 101 [2024-10-13 06:33:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:20,203 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2024-10-13 06:33:20,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 06:33:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2024-10-13 06:33:20,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:33:20,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:20,211 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:33:20,224 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-13 06:33:20,412 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-13 06:33:20,412 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:20,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:20,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1452374648, now seen corresponding path program 1 times [2024-10-13 06:33:20,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:20,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334557439] [2024-10-13 06:33:20,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:20,414 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-13 06:33:20,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:20,415 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-13 06:33:20,423 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-13 06:33:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 06:33:20,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:20,919 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 24 treesize of output 23 [2024-10-13 06:33:21,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:21,139 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 39 treesize of output 26 [2024-10-13 06:33:21,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:21,287 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 39 treesize of output 26 [2024-10-13 06:33:21,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:21,401 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 39 treesize of output 26 [2024-10-13 06:33:21,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:21,505 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 46 [2024-10-13 06:33:25,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:25,859 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 52 [2024-10-13 06:33:26,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:26,200 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 54 treesize of output 62 [2024-10-13 06:33:26,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:26,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 71 treesize of output 76 [2024-10-13 06:33:26,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:26,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 80 [2024-10-13 06:33:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-13 06:33:27,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:27,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:27,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334557439] [2024-10-13 06:33:27,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334557439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:27,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:27,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:33:27,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667581982] [2024-10-13 06:33:27,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:27,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:33:27,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:27,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:33:27,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=32, Unknown=1, NotChecked=0, Total=56 [2024-10-13 06:33:27,033 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-13 06:33:30,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 06:33:32,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 06:33:35,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:33:39,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 06:33:41,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:33:42,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:42,442 INFO L93 Difference]: Finished difference Result 352 states and 489 transitions. [2024-10-13 06:33:42,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:33:42,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 103 [2024-10-13 06:33:42,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:42,444 INFO L225 Difference]: With dead ends: 352 [2024-10-13 06:33:42,444 INFO L226 Difference]: Without dead ends: 263 [2024-10-13 06:33:42,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=39, Invalid=50, Unknown=1, NotChecked=0, Total=90 [2024-10-13 06:33:42,447 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 434 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:42,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 289 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 15.2s Time] [2024-10-13 06:33:42,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-13 06:33:42,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 256. [2024-10-13 06:33:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 224 states have (on average 1.3392857142857142) internal successors, (300), 225 states have internal predecessors, (300), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 06:33:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 356 transitions. [2024-10-13 06:33:42,493 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 356 transitions. Word has length 103 [2024-10-13 06:33:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:42,493 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 356 transitions. [2024-10-13 06:33:42,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-13 06:33:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 356 transitions. [2024-10-13 06:33:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:33:42,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:42,494 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:33:42,507 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-13 06:33:42,695 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-13 06:33:42,695 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:42,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:42,696 INFO L85 PathProgramCache]: Analyzing trace with hash 172510970, now seen corresponding path program 1 times [2024-10-13 06:33:42,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:42,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607224819] [2024-10-13 06:33:42,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:42,697 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-13 06:33:42,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:42,699 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-13 06:33:42,700 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