./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.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 4e5482dd6ba3374aff0d8883ae694cf340167e4fdd04dcf1b79ac1391ce8afb5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:54:52,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:54:52,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:54:52,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:54:52,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:54:52,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:54:52,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:54:52,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:54:52,263 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:54:52,264 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:54:52,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:54:52,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:54:52,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:54:52,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:54:52,265 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:54:52,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:54:52,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:54:52,266 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:54:52,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:54:52,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:54:52,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:54:52,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:54:52,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:54:52,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:54:52,271 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:54:52,271 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:54:52,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:54:52,271 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:54:52,272 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:54:52,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:54:52,272 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:54:52,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:54:52,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:54:52,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:54:52,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:54:52,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:54:52,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:54:52,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:54:52,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:54:52,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:54:52,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:54:52,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:54:52,276 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 -> 4e5482dd6ba3374aff0d8883ae694cf340167e4fdd04dcf1b79ac1391ce8afb5 [2024-11-10 04:54:52,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:54:52,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:54:52,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:54:52,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:54:52,534 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:54:52,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i [2024-11-10 04:54:53,935 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:54:54,106 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:54:54,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i [2024-11-10 04:54:54,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a544665bf/feb11fd0f10f47309fe76292caef050b/FLAG8a82d4b74 [2024-11-10 04:54:54,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a544665bf/feb11fd0f10f47309fe76292caef050b [2024-11-10 04:54:54,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:54:54,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:54:54,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:54:54,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:54:54,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:54:54,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:54:54" (1/1) ... [2024-11-10 04:54:54,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71869034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:54, skipping insertion in model container [2024-11-10 04:54:54,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:54:54" (1/1) ... [2024-11-10 04:54:54,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:54:54,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i[919,932] [2024-11-10 04:54:54,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:54:54,443 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:54:54,474 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i[919,932] [2024-11-10 04:54:54,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:54:54,553 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:54:54,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:54 WrapperNode [2024-11-10 04:54:54,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:54:54,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:54:54,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:54:54,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:54:54,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:54" (1/1) ... [2024-11-10 04:54:54,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:54" (1/1) ... [2024-11-10 04:54:54,602 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-11-10 04:54:54,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:54:54,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:54:54,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:54:54,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:54:54,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:54" (1/1) ... [2024-11-10 04:54:54,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:54" (1/1) ... [2024-11-10 04:54:54,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:54" (1/1) ... [2024-11-10 04:54:54,641 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:54:54,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:54" (1/1) ... [2024-11-10 04:54:54,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:54" (1/1) ... [2024-11-10 04:54:54,649 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:54" (1/1) ... [2024-11-10 04:54:54,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:54" (1/1) ... [2024-11-10 04:54:54,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:54" (1/1) ... [2024-11-10 04:54:54,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:54" (1/1) ... [2024-11-10 04:54:54,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:54:54,663 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:54:54,663 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:54:54,663 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:54:54,664 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:54" (1/1) ... [2024-11-10 04:54:54,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:54:54,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:54:54,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:54:54,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:54:54,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:54:54,757 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:54:54,757 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:54:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:54:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:54:54,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:54:54,837 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:54:54,840 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:54:55,176 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 04:54:55,177 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:54:55,199 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:54:55,200 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:54:55,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:54:55 BoogieIcfgContainer [2024-11-10 04:54:55,200 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:54:55,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:54:55,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:54:55,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:54:55,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:54:54" (1/3) ... [2024-11-10 04:54:55,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d314350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:54:55, skipping insertion in model container [2024-11-10 04:54:55,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:54" (2/3) ... [2024-11-10 04:54:55,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d314350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:54:55, skipping insertion in model container [2024-11-10 04:54:55,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:54:55" (3/3) ... [2024-11-10 04:54:55,211 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i [2024-11-10 04:54:55,226 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:54:55,226 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:54:55,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:54:55,302 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;@6dd021f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:54:55,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:54:55,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 04:54:55,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 04:54:55,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:55,322 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:55,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:55,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:55,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1178916443, now seen corresponding path program 1 times [2024-11-10 04:54:55,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:54:55,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297015133] [2024-11-10 04:54:55,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:55,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:54:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:54:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:54:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 04:54:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:54:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:54:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:54:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:54:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:54:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 04:54:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:54:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 04:54:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:54:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:54:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:54:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:54:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:54:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:54:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:54:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 04:54:55,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:54:55,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297015133] [2024-11-10 04:54:55,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297015133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:54:55,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:54:55,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:54:55,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739321681] [2024-11-10 04:54:55,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:54:55,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:54:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:54:55,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:54:55,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:54:55,802 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 04:54:55,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:54:55,830 INFO L93 Difference]: Finished difference Result 144 states and 242 transitions. [2024-11-10 04:54:55,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:54:55,832 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 131 [2024-11-10 04:54:55,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:54:55,840 INFO L225 Difference]: With dead ends: 144 [2024-11-10 04:54:55,840 INFO L226 Difference]: Without dead ends: 70 [2024-11-10 04:54:55,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:54:55,847 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:54:55,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:54:55,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-10 04:54:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-10 04:54:55,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 04:54:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 104 transitions. [2024-11-10 04:54:55,892 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 104 transitions. Word has length 131 [2024-11-10 04:54:55,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:54:55,893 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 104 transitions. [2024-11-10 04:54:55,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 04:54:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 104 transitions. [2024-11-10 04:54:55,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 04:54:55,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:55,898 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:55,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:54:55,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:55,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:55,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1436957948, now seen corresponding path program 1 times [2024-11-10 04:54:55,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:54:55,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047435810] [2024-11-10 04:54:55,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:55,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:54:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:54:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:54:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 04:54:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:54:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:54:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:54:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:54:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:54:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 04:54:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:54:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 04:54:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:54:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:54:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:54:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:54:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:54:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:54:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:54:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 04:54:56,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:54:56,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047435810] [2024-11-10 04:54:56,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047435810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:54:56,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:54:56,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 04:54:56,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112870316] [2024-11-10 04:54:56,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:54:56,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 04:54:56,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:54:56,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 04:54:56,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 04:54:56,627 INFO L87 Difference]: Start difference. First operand 70 states and 104 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 04:54:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:54:57,118 INFO L93 Difference]: Finished difference Result 248 states and 364 transitions. [2024-11-10 04:54:57,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 04:54:57,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 132 [2024-11-10 04:54:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:54:57,123 INFO L225 Difference]: With dead ends: 248 [2024-11-10 04:54:57,123 INFO L226 Difference]: Without dead ends: 181 [2024-11-10 04:54:57,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 04:54:57,126 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 240 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 04:54:57,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 371 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 04:54:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-10 04:54:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 117. [2024-11-10 04:54:57,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 88 states have internal predecessors, (120), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-10 04:54:57,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 174 transitions. [2024-11-10 04:54:57,159 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 174 transitions. Word has length 132 [2024-11-10 04:54:57,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:54:57,159 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 174 transitions. [2024-11-10 04:54:57,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 04:54:57,160 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 174 transitions. [2024-11-10 04:54:57,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 04:54:57,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:57,161 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:57,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:54:57,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:57,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:57,162 INFO L85 PathProgramCache]: Analyzing trace with hash -83648251, now seen corresponding path program 1 times [2024-11-10 04:54:57,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:54:57,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616037205] [2024-11-10 04:54:57,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:57,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:54:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:54:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:54:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 04:54:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:54:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:54:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:54:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:54:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:54:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 04:54:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:54:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 04:54:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:54:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:54:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:54:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:54:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:54:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:54:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:54:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-10 04:54:57,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:54:57,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616037205] [2024-11-10 04:54:57,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616037205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:54:57,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086115016] [2024-11-10 04:54:57,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:57,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:54:57,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:54:57,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:54:57,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 04:54:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:57,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 04:54:57,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:54:57,802 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 321 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 04:54:57,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:54:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-10 04:54:58,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086115016] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:54:58,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:54:58,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 04:54:58,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278195690] [2024-11-10 04:54:58,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:54:58,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 04:54:58,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:54:58,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 04:54:58,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:54:58,004 INFO L87 Difference]: Start difference. First operand 117 states and 174 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 04:54:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:54:58,188 INFO L93 Difference]: Finished difference Result 197 states and 284 transitions. [2024-11-10 04:54:58,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 04:54:58,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 132 [2024-11-10 04:54:58,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:54:58,192 INFO L225 Difference]: With dead ends: 197 [2024-11-10 04:54:58,194 INFO L226 Difference]: Without dead ends: 83 [2024-11-10 04:54:58,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:54:58,196 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 100 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:54:58,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 169 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:54:58,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-10 04:54:58,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2024-11-10 04:54:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 04:54:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2024-11-10 04:54:58,222 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 132 [2024-11-10 04:54:58,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:54:58,222 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2024-11-10 04:54:58,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 04:54:58,223 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2024-11-10 04:54:58,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 04:54:58,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:58,224 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:58,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 04:54:58,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:54:58,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:58,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:58,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1626299257, now seen corresponding path program 1 times [2024-11-10 04:54:58,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:54:58,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936939417] [2024-11-10 04:54:58,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:58,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:54:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:54:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:54:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 04:54:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:54:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:54:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:54:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:54:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:54:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 04:54:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:54:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 04:54:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:54:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:54:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:54:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:54:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:54:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:54:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:54:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 04:54:58,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:54:58,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936939417] [2024-11-10 04:54:58,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936939417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:54:58,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:54:58,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:54:58,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255838989] [2024-11-10 04:54:58,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:54:58,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:54:58,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:54:58,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:54:58,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:54:58,708 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 04:54:58,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:54:58,882 INFO L93 Difference]: Finished difference Result 191 states and 253 transitions. [2024-11-10 04:54:58,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:54:58,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 132 [2024-11-10 04:54:58,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:54:58,884 INFO L225 Difference]: With dead ends: 191 [2024-11-10 04:54:58,884 INFO L226 Difference]: Without dead ends: 117 [2024-11-10 04:54:58,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:54:58,885 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 118 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:54:58,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 159 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:54:58,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-10 04:54:58,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 81. [2024-11-10 04:54:58,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 04:54:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2024-11-10 04:54:58,906 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 132 [2024-11-10 04:54:58,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:54:58,906 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2024-11-10 04:54:58,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 04:54:58,907 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2024-11-10 04:54:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 04:54:58,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:58,911 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:58,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:54:58,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:58,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:58,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1822812762, now seen corresponding path program 1 times [2024-11-10 04:54:58,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:54:58,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122223426] [2024-11-10 04:54:58,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:58,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:54:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:54:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:54:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 04:54:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:54:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 04:54:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:54:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:54:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:54:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 04:54:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:54:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 04:54:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:54:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:54:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:54:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:54:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:54:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:54:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:54:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 04:54:59,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:54:59,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122223426] [2024-11-10 04:54:59,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122223426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:54:59,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:54:59,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:54:59,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051659673] [2024-11-10 04:54:59,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:54:59,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:54:59,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:54:59,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:54:59,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:54:59,274 INFO L87 Difference]: Start difference. First operand 81 states and 105 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 04:54:59,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:54:59,362 INFO L93 Difference]: Finished difference Result 205 states and 268 transitions. [2024-11-10 04:54:59,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:54:59,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 132 [2024-11-10 04:54:59,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:54:59,364 INFO L225 Difference]: With dead ends: 205 [2024-11-10 04:54:59,364 INFO L226 Difference]: Without dead ends: 127 [2024-11-10 04:54:59,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:54:59,366 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 72 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:54:59,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 278 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:54:59,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-10 04:54:59,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 100. [2024-11-10 04:54:59,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 77 states have internal predecessors, (95), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 04:54:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2024-11-10 04:54:59,385 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 132 [2024-11-10 04:54:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:54:59,386 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2024-11-10 04:54:59,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 04:54:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2024-11-10 04:54:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 04:54:59,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:59,388 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:59,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 04:54:59,388 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:59,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:59,389 INFO L85 PathProgramCache]: Analyzing trace with hash 664700071, now seen corresponding path program 1 times [2024-11-10 04:54:59,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:54:59,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67256658] [2024-11-10 04:54:59,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:59,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:54:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:54:59,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [736303909] [2024-11-10 04:54:59,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:59,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:54:59,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:54:59,477 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:54:59,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 04:54:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:54:59,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 04:54:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:54:59,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 04:54:59,808 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 04:54:59,809 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 04:54:59,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 04:55:00,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 04:55:00,017 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 04:55:00,120 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 04:55:00,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:55:00 BoogieIcfgContainer [2024-11-10 04:55:00,123 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 04:55:00,124 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 04:55:00,124 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 04:55:00,124 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 04:55:00,124 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:54:55" (3/4) ... [2024-11-10 04:55:00,126 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 04:55:00,128 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 04:55:00,128 INFO L158 Benchmark]: Toolchain (without parser) took 5985.95ms. Allocated memory was 132.1MB in the beginning and 211.8MB in the end (delta: 79.7MB). Free memory was 77.0MB in the beginning and 130.3MB in the end (delta: -53.3MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-11-10 04:55:00,128 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 132.1MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:55:00,129 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.05ms. Allocated memory is still 132.1MB. Free memory was 76.7MB in the beginning and 100.6MB in the end (delta: -23.9MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-11-10 04:55:00,129 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.94ms. Allocated memory is still 132.1MB. Free memory was 100.6MB in the beginning and 96.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:55:00,129 INFO L158 Benchmark]: Boogie Preprocessor took 59.69ms. Allocated memory is still 132.1MB. Free memory was 96.4MB in the beginning and 88.8MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 04:55:00,129 INFO L158 Benchmark]: IcfgBuilder took 537.33ms. Allocated memory is still 132.1MB. Free memory was 88.8MB in the beginning and 61.5MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 04:55:00,129 INFO L158 Benchmark]: TraceAbstraction took 4920.73ms. Allocated memory was 132.1MB in the beginning and 211.8MB in the end (delta: 79.7MB). Free memory was 61.4MB in the beginning and 131.4MB in the end (delta: -70.0MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-10 04:55:00,130 INFO L158 Benchmark]: Witness Printer took 4.11ms. Allocated memory is still 211.8MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:55:00,131 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.19ms. Allocated memory is still 132.1MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.05ms. Allocated memory is still 132.1MB. Free memory was 76.7MB in the beginning and 100.6MB in the end (delta: -23.9MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.94ms. Allocated memory is still 132.1MB. Free memory was 100.6MB in the beginning and 96.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.69ms. Allocated memory is still 132.1MB. Free memory was 96.4MB in the beginning and 88.8MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 537.33ms. Allocated memory is still 132.1MB. Free memory was 88.8MB in the beginning and 61.5MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4920.73ms. Allocated memory was 132.1MB in the beginning and 211.8MB in the end (delta: 79.7MB). Free memory was 61.4MB in the beginning and 131.4MB in the end (delta: -70.0MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Witness Printer took 4.11ms. Allocated memory is still 211.8MB. Free memory is still 130.3MB. 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 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someUnaryDOUBLEoperation at line 35. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] unsigned long int var_1_34 = 50; [L42] double var_1_35 = 31.1; [L43] unsigned long int var_1_37 = 64; [L44] signed long int var_1_38 = 8; [L45] float var_1_39 = 200.6; [L46] unsigned short int var_1_40 = 2; [L47] signed char var_1_42 = -4; [L48] double var_1_43 = 2.75; [L49] signed char var_1_45 = 32; [L50] unsigned long int var_1_46 = 32; [L51] signed long int var_1_47 = -256; [L52] unsigned char last_1_var_1_9 = 1; [L53] float last_1_var_1_24 = 128.5; VAL [isInitial=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L164] isInitial = 1 [L165] FCALL initially() [L166] COND TRUE 1 [L167] CALL updateLastVariables() [L156] last_1_var_1_9 = var_1_9 [L157] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L167] RET updateLastVariables() [L168] CALL updateVariables() [L127] var_1_4 = __VERIFIER_nondet_short() [L128] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=5, var_1_9=1] [L128] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=5, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=5, var_1_9=1] [L129] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=5, var_1_9=1] [L130] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=5, var_1_9=1] [L130] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=5, var_1_9=1] [L131] var_1_8 = __VERIFIER_nondet_ushort() [L132] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_9=1] [L132] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_9=1] [L133] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L133] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L134] var_1_10 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L135] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L136] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L137] var_1_11 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L139] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L140] var_1_15 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L142] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L142] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L143] var_1_20 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L145] var_1_28 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L148] var_1_29 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L151] var_1_39 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_39 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L153] RET assume_abort_if_not(var_1_39 != 0.0F) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=16, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L168] RET updateVariables() [L169] CALL step() [L57] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L64] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L66] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=-255, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=1] [L67] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L68] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=-256] [L70] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=7, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=-256] [L71] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L74] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=7, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=-256] [L76] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=7, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=-256] [L77] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=7, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=-256] [L80] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=7, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=-256] [L84] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L85] var_1_25 = var_1_20 [L86] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=7, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=7, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=7, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=-256] [L87] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L88] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=7, var_1_17=127/5, var_1_1=7, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=7, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=-256] [L92] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=7, var_1_17=127/5, var_1_1=7, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=7, var_1_27=2, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=-256] [L95] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=7, var_1_17=127/5, var_1_1=7, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=7, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=-256] [L96] COND FALSE !(var_1_9 && var_1_11) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=7, var_1_17=127/5, var_1_1=7, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=7, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=-256] [L99] COND FALSE !(var_1_28 > var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=7, var_1_17=127/5, var_1_1=7, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=7, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=-256] [L104] var_1_35 = var_1_20 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=7, var_1_17=127/5, var_1_1=7, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=7, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=-256] [L105] COND FALSE !((var_1_9 && var_1_11) && (var_1_21 > var_1_15)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=7, var_1_17=127/5, var_1_1=7, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=7, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=-256] [L108] COND FALSE !((((((var_1_20 / var_1_39)) > (var_1_20)) ? ((var_1_20 / var_1_39)) : (var_1_20))) > 100.3) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=7, var_1_17=127/5, var_1_1=7, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=7, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=-256] [L113] COND FALSE !(var_1_12 > ((var_1_29 >> 1) + var_1_21)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=7, var_1_17=127/5, var_1_1=7, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=7, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=-256] [L116] COND FALSE !(var_1_11 || var_1_9) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=7, var_1_17=127/5, var_1_1=7, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=7, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=-256] [L119] EXPR var_1_12 | var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=7, var_1_17=127/5, var_1_1=7, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=7, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-47, var_1_8=0, var_1_9=-256] [L119] COND FALSE !(var_1_28 > (var_1_12 | var_1_12)) [L122] var_1_45 = var_1_28 [L123] var_1_46 = var_1_15 [L124] var_1_47 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=7, var_1_17=127/5, var_1_1=7, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=7, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=1, var_1_46=7, var_1_47=7, var_1_4=-47, var_1_8=0, var_1_9=-256] [L169] RET step() [L170] CALL, EXPR property() [L160-L161] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=7, var_1_17=127/5, var_1_1=7, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=7, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=1, var_1_46=7, var_1_47=7, var_1_4=-47, var_1_8=0, var_1_9=-256] [L170] RET, EXPR property() [L170] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=7, var_1_17=127/5, var_1_1=7, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=7, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=1, var_1_46=7, var_1_47=7, var_1_4=-47, var_1_8=0, var_1_9=-256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=-256, var_1_12=-249, var_1_15=-249, var_1_16=7, var_1_17=127/5, var_1_1=7, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=7, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=1, var_1_46=7, var_1_47=7, var_1_4=-47, var_1_8=0, var_1_9=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 6, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 537 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 530 mSDsluCounter, 1081 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 573 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 426 IncrementalHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 508 mSDtfsCounter, 426 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 499 GetRequests, 477 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=2, InterpolantAutomatonStates: 26, 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, 133 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1055 NumberOfCodeBlocks, 1055 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 916 ConstructedInterpolants, 0 QuantifiedInterpolants, 2120 SizeOfPredicates, 1 NumberOfNonLiveVariables, 336 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 4203/4284 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 04:55:00,152 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.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 4e5482dd6ba3374aff0d8883ae694cf340167e4fdd04dcf1b79ac1391ce8afb5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:55:02,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:55:02,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 04:55:02,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:55:02,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:55:02,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:55:02,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:55:02,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:55:02,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:55:02,333 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:55:02,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:55:02,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:55:02,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:55:02,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:55:02,338 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:55:02,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:55:02,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:55:02,339 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:55:02,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:55:02,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:55:02,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:55:02,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:55:02,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:55:02,342 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 04:55:02,342 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 04:55:02,343 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:55:02,343 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 04:55:02,343 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:55:02,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:55:02,343 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:55:02,344 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:55:02,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:55:02,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:55:02,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:55:02,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:55:02,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:55:02,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:55:02,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:55:02,345 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 04:55:02,345 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 04:55:02,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:55:02,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:55:02,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:55:02,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:55:02,347 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 -> 4e5482dd6ba3374aff0d8883ae694cf340167e4fdd04dcf1b79ac1391ce8afb5 [2024-11-10 04:55:02,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:55:02,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:55:02,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:55:02,665 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:55:02,666 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:55:02,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i [2024-11-10 04:55:04,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:55:04,316 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:55:04,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i [2024-11-10 04:55:04,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09f7ebdd4/ea95993075ca4d4b9d165ef146201eb1/FLAG56395bb49 [2024-11-10 04:55:04,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09f7ebdd4/ea95993075ca4d4b9d165ef146201eb1 [2024-11-10 04:55:04,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:55:04,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:55:04,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:55:04,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:55:04,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:55:04,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:55:04" (1/1) ... [2024-11-10 04:55:04,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4573297f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:04, skipping insertion in model container [2024-11-10 04:55:04,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:55:04" (1/1) ... [2024-11-10 04:55:04,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:55:04,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i[919,932] [2024-11-10 04:55:04,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:55:04,968 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:55:04,979 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i[919,932] [2024-11-10 04:55:05,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:55:05,029 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:55:05,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:05 WrapperNode [2024-11-10 04:55:05,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:55:05,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:55:05,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:55:05,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:55:05,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:05" (1/1) ... [2024-11-10 04:55:05,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:05" (1/1) ... [2024-11-10 04:55:05,082 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-11-10 04:55:05,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:55:05,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:55:05,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:55:05,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:55:05,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:05" (1/1) ... [2024-11-10 04:55:05,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:05" (1/1) ... [2024-11-10 04:55:05,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:05" (1/1) ... [2024-11-10 04:55:05,122 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:55:05,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:05" (1/1) ... [2024-11-10 04:55:05,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:05" (1/1) ... [2024-11-10 04:55:05,131 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:05" (1/1) ... [2024-11-10 04:55:05,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:05" (1/1) ... [2024-11-10 04:55:05,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:05" (1/1) ... [2024-11-10 04:55:05,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:05" (1/1) ... [2024-11-10 04:55:05,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:55:05,146 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:55:05,146 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:55:05,147 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:55:05,148 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:05" (1/1) ... [2024-11-10 04:55:05,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:55:05,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:55:05,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:55:05,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:55:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:55:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 04:55:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:55:05,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:55:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:55:05,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:55:05,320 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:55:05,322 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:55:09,735 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 04:55:09,735 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:55:09,751 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:55:09,752 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:55:09,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:55:09 BoogieIcfgContainer [2024-11-10 04:55:09,752 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:55:09,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:55:09,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:55:09,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:55:09,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:55:04" (1/3) ... [2024-11-10 04:55:09,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d36f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:55:09, skipping insertion in model container [2024-11-10 04:55:09,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:05" (2/3) ... [2024-11-10 04:55:09,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d36f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:55:09, skipping insertion in model container [2024-11-10 04:55:09,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:55:09" (3/3) ... [2024-11-10 04:55:09,761 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i [2024-11-10 04:55:09,774 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:55:09,774 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:55:09,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:55:09,827 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;@9f8cca6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:55:09,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:55:09,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 04:55:09,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 04:55:09,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:55:09,841 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:55:09,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:55:09,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:55:09,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1006330043, now seen corresponding path program 1 times [2024-11-10 04:55:09,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:55:09,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874573548] [2024-11-10 04:55:09,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:55:09,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:09,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:55:09,858 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:55:09,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 04:55:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:10,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 04:55:10,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:55:10,321 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 04:55:10,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:55:10,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:55:10,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874573548] [2024-11-10 04:55:10,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874573548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:55:10,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:55:10,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:55:10,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125151183] [2024-11-10 04:55:10,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:55:10,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:55:10,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:55:10,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:55:10,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:55:10,356 INFO L87 Difference]: Start difference. First operand has 74 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 04:55:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:55:10,384 INFO L93 Difference]: Finished difference Result 140 states and 235 transitions. [2024-11-10 04:55:10,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:55:10,386 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-10 04:55:10,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:55:10,392 INFO L225 Difference]: With dead ends: 140 [2024-11-10 04:55:10,392 INFO L226 Difference]: Without dead ends: 69 [2024-11-10 04:55:10,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:55:10,397 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:55:10,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:55:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-10 04:55:10,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-10 04:55:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 04:55:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2024-11-10 04:55:10,438 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 130 [2024-11-10 04:55:10,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:55:10,440 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2024-11-10 04:55:10,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 04:55:10,440 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2024-11-10 04:55:10,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 04:55:10,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:55:10,445 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:55:10,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 04:55:10,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:10,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:55:10,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:55:10,648 INFO L85 PathProgramCache]: Analyzing trace with hash -801943807, now seen corresponding path program 1 times [2024-11-10 04:55:10,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:55:10,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642014480] [2024-11-10 04:55:10,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:55:10,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:10,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:55:10,653 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:55:10,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 04:55:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:11,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 04:55:11,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:55:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 321 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 04:55:11,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:55:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-10 04:55:11,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:55:11,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642014480] [2024-11-10 04:55:11,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642014480] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:55:11,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 04:55:11,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-10 04:55:11,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134273133] [2024-11-10 04:55:11,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 04:55:11,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 04:55:11,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:55:11,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 04:55:11,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:55:11,995 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 04:55:12,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:55:12,524 INFO L93 Difference]: Finished difference Result 141 states and 206 transitions. [2024-11-10 04:55:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 04:55:12,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 131 [2024-11-10 04:55:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:55:12,538 INFO L225 Difference]: With dead ends: 141 [2024-11-10 04:55:12,538 INFO L226 Difference]: Without dead ends: 75 [2024-11-10 04:55:12,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:55:12,539 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 80 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 04:55:12,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 163 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 04:55:12,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-10 04:55:12,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2024-11-10 04:55:12,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 04:55:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2024-11-10 04:55:12,563 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 98 transitions. Word has length 131 [2024-11-10 04:55:12,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:55:12,568 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 98 transitions. [2024-11-10 04:55:12,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 04:55:12,569 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 98 transitions. [2024-11-10 04:55:12,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 04:55:12,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:55:12,570 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:55:12,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 04:55:12,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:12,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:55:12,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:55:12,774 INFO L85 PathProgramCache]: Analyzing trace with hash -847542784, now seen corresponding path program 1 times [2024-11-10 04:55:12,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:55:12,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620102761] [2024-11-10 04:55:12,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:55:12,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:12,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:55:12,776 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:55:12,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 04:55:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 04:55:13,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:55:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 04:55:13,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:55:13,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:55:13,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620102761] [2024-11-10 04:55:13,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620102761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:55:13,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:55:13,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:55:13,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583127710] [2024-11-10 04:55:13,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:55:13,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:55:13,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:55:13,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:55:13,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:55:13,137 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 04:55:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:55:13,301 INFO L93 Difference]: Finished difference Result 139 states and 193 transitions. [2024-11-10 04:55:13,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:55:13,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2024-11-10 04:55:13,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:55:13,311 INFO L225 Difference]: With dead ends: 139 [2024-11-10 04:55:13,311 INFO L226 Difference]: Without dead ends: 71 [2024-11-10 04:55:13,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:55:13,313 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 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.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:55:13,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:55:13,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-10 04:55:13,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-10 04:55:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 04:55:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2024-11-10 04:55:13,324 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 131 [2024-11-10 04:55:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:55:13,325 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2024-11-10 04:55:13,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 04:55:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2024-11-10 04:55:13,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 04:55:13,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:55:13,328 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:55:13,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 04:55:13,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:13,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:55:13,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:55:13,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1692014655, now seen corresponding path program 1 times [2024-11-10 04:55:13,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:55:13,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192558721] [2024-11-10 04:55:13,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:55:13,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:13,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:55:13,533 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:55:13,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 04:55:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 04:55:13,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:55:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 04:55:14,054 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:55:14,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:55:14,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192558721] [2024-11-10 04:55:14,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192558721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:55:14,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:55:14,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 04:55:14,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243889380] [2024-11-10 04:55:14,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:55:14,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:55:14,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:55:14,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:55:14,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:55:14,056 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 04:55:14,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:55:14,845 INFO L93 Difference]: Finished difference Result 245 states and 335 transitions. [2024-11-10 04:55:14,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 04:55:14,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2024-11-10 04:55:14,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:55:14,848 INFO L225 Difference]: With dead ends: 245 [2024-11-10 04:55:14,848 INFO L226 Difference]: Without dead ends: 177 [2024-11-10 04:55:14,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:55:14,850 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 205 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 04:55:14,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 325 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 04:55:14,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-10 04:55:14,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 113. [2024-11-10 04:55:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 72 states have internal predecessors, (82), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 04:55:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 154 transitions. [2024-11-10 04:55:14,882 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 154 transitions. Word has length 131 [2024-11-10 04:55:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:55:14,883 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 154 transitions. [2024-11-10 04:55:14,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 04:55:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 154 transitions. [2024-11-10 04:55:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 04:55:14,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:55:14,886 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:55:14,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 04:55:15,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:15,087 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:55:15,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:55:15,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2092418464, now seen corresponding path program 1 times [2024-11-10 04:55:15,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:55:15,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708863771] [2024-11-10 04:55:15,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:55:15,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:15,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:55:15,090 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:55:15,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 04:55:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:15,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 04:55:15,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:55:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 213 proven. 9 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-10 04:55:15,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:55:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 04:55:16,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:55:16,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1708863771] [2024-11-10 04:55:16,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1708863771] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 04:55:16,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 04:55:16,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-10 04:55:16,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731991528] [2024-11-10 04:55:16,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:55:16,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:55:16,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:55:16,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:55:16,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:55:16,078 INFO L87 Difference]: Start difference. First operand 113 states and 154 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 04:55:16,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:55:16,515 INFO L93 Difference]: Finished difference Result 190 states and 255 transitions. [2024-11-10 04:55:16,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:55:16,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2024-11-10 04:55:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:55:16,518 INFO L225 Difference]: With dead ends: 190 [2024-11-10 04:55:16,518 INFO L226 Difference]: Without dead ends: 117 [2024-11-10 04:55:16,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:55:16,519 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 61 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 04:55:16,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 165 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 04:55:16,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-10 04:55:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-10 04:55:16,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 74 states have (on average 1.135135135135135) internal successors, (84), 75 states have internal predecessors, (84), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 04:55:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 156 transitions. [2024-11-10 04:55:16,554 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 156 transitions. Word has length 131 [2024-11-10 04:55:16,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:55:16,555 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 156 transitions. [2024-11-10 04:55:16,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 04:55:16,555 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 156 transitions. [2024-11-10 04:55:16,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 04:55:16,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:55:16,556 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:55:16,573 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-11-10 04:55:16,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:16,757 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:55:16,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:55:16,757 INFO L85 PathProgramCache]: Analyzing trace with hash 284964001, now seen corresponding path program 1 times [2024-11-10 04:55:16,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:55:16,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68523832] [2024-11-10 04:55:16,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:55:16,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:16,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:55:16,761 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:55:16,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 04:55:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:17,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 04:55:17,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:55:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 321 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 04:55:17,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:55:18,168 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-10 04:55:18,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:55:18,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68523832] [2024-11-10 04:55:18,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68523832] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:55:18,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 04:55:18,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-10 04:55:18,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545965631] [2024-11-10 04:55:18,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 04:55:18,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 04:55:18,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:55:18,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 04:55:18,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 04:55:18,172 INFO L87 Difference]: Start difference. First operand 117 states and 156 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 04:55:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:55:19,030 INFO L93 Difference]: Finished difference Result 251 states and 327 transitions. [2024-11-10 04:55:19,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 04:55:19,031 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 131 [2024-11-10 04:55:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:55:19,032 INFO L225 Difference]: With dead ends: 251 [2024-11-10 04:55:19,032 INFO L226 Difference]: Without dead ends: 174 [2024-11-10 04:55:19,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-10 04:55:19,034 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 172 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 04:55:19,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 223 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 04:55:19,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-10 04:55:19,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 136. [2024-11-10 04:55:19,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 94 states have internal predecessors, (109), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 04:55:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 181 transitions. [2024-11-10 04:55:19,046 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 181 transitions. Word has length 131 [2024-11-10 04:55:19,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:55:19,047 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 181 transitions. [2024-11-10 04:55:19,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 04:55:19,047 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 181 transitions. [2024-11-10 04:55:19,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 04:55:19,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:55:19,048 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:55:19,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-10 04:55:19,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:19,249 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:55:19,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:55:19,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2027774336, now seen corresponding path program 1 times [2024-11-10 04:55:19,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:55:19,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005656159] [2024-11-10 04:55:19,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:55:19,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:19,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:55:19,251 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:55:19,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 04:55:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:19,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 04:55:19,606 INFO L278 TraceCheckSpWp]: Computing forward predicates...