./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_floatingpointinfluence_no-floats_file-50.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 d48f2c1830cdd6ac90cdee4bcb795720c0a52828893f188513897f8df44010d8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:10:49,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:10:49,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:10:49,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:10:49,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:10:49,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:10:49,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:10:49,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:10:49,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:10:49,727 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:10:49,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:10:49,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:10:49,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:10:49,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:10:49,729 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:10:49,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:10:49,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:10:49,730 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:10:49,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:10:49,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:10:49,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:10:49,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:10:49,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:10:49,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:10:49,735 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:10:49,735 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:10:49,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:10:49,736 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:10:49,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:10:49,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:10:49,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:10:49,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:10:49,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:10:49,739 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:10:49,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:10:49,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:10:49,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:10:49,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:10:49,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:10:49,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:10:49,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:10:49,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:10:49,742 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 -> d48f2c1830cdd6ac90cdee4bcb795720c0a52828893f188513897f8df44010d8 [2024-11-08 23:10:50,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:10:50,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:10:50,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:10:50,034 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:10:50,034 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:10:50,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-50.i [2024-11-08 23:10:51,658 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:10:51,876 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:10:51,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-50.i [2024-11-08 23:10:51,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e75892df4/324cf6b935254830bd2c05ef7c194657/FLAGf9f787574 [2024-11-08 23:10:52,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e75892df4/324cf6b935254830bd2c05ef7c194657 [2024-11-08 23:10:52,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:10:52,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:10:52,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:10:52,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:10:52,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:10:52,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:10:52" (1/1) ... [2024-11-08 23:10:52,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674b34ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:52, skipping insertion in model container [2024-11-08 23:10:52,248 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:10:52" (1/1) ... [2024-11-08 23:10:52,282 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:10:52,451 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_floatingpointinfluence_no-floats_file-50.i[916,929] [2024-11-08 23:10:52,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:10:52,546 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:10:52,557 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_floatingpointinfluence_no-floats_file-50.i[916,929] [2024-11-08 23:10:52,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:10:52,599 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:10:52,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:52 WrapperNode [2024-11-08 23:10:52,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:10:52,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:10:52,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:10:52,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:10:52,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:52" (1/1) ... [2024-11-08 23:10:52,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:52" (1/1) ... [2024-11-08 23:10:52,646 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-11-08 23:10:52,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:10:52,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:10:52,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:10:52,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:10:52,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:52" (1/1) ... [2024-11-08 23:10:52,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:52" (1/1) ... [2024-11-08 23:10:52,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:52" (1/1) ... [2024-11-08 23:10:52,682 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-08 23:10:52,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:52" (1/1) ... [2024-11-08 23:10:52,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:52" (1/1) ... [2024-11-08 23:10:52,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:52" (1/1) ... [2024-11-08 23:10:52,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:52" (1/1) ... [2024-11-08 23:10:52,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:52" (1/1) ... [2024-11-08 23:10:52,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:52" (1/1) ... [2024-11-08 23:10:52,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:10:52,699 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:10:52,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:10:52,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:10:52,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:52" (1/1) ... [2024-11-08 23:10:52,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:10:52,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:10:52,734 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-08 23:10:52,738 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-08 23:10:52,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:10:52,781 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:10:52,782 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:10:52,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:10:52,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:10:52,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:10:52,855 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:10:52,858 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:10:53,101 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 23:10:53,101 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:10:53,123 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:10:53,124 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:10:53,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:10:53 BoogieIcfgContainer [2024-11-08 23:10:53,124 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:10:53,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:10:53,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:10:53,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:10:53,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:10:52" (1/3) ... [2024-11-08 23:10:53,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2957ac38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:10:53, skipping insertion in model container [2024-11-08 23:10:53,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:52" (2/3) ... [2024-11-08 23:10:53,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2957ac38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:10:53, skipping insertion in model container [2024-11-08 23:10:53,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:10:53" (3/3) ... [2024-11-08 23:10:53,137 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-50.i [2024-11-08 23:10:53,150 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:10:53,150 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:10:53,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:10:53,215 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;@6d38e9f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:10:53,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:10:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 23:10:53,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 23:10:53,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:10:53,240 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:10:53,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:10:53,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:10:53,247 INFO L85 PathProgramCache]: Analyzing trace with hash -416482401, now seen corresponding path program 1 times [2024-11-08 23:10:53,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:10:53,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339932629] [2024-11-08 23:10:53,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:53,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:10:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:10:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:10:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:10:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:10:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:10:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:10:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:10:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:10:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:10:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:10:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:10:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:10:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:10:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:10:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:10:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:10:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:10:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:10:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:10:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:10:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:10:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:10:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:10:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:10:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:10:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 23:10:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:10:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 23:10:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:10:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 23:10:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 23:10:53,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:10:53,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339932629] [2024-11-08 23:10:53,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339932629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:10:53,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:10:53,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:10:53,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180098940] [2024-11-08 23:10:53,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:10:53,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:10:53,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:10:53,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:10:53,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:10:53,944 INFO L87 Difference]: Start difference. First operand has 72 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 23:10:53,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:10:53,985 INFO L93 Difference]: Finished difference Result 137 states and 244 transitions. [2024-11-08 23:10:53,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:10:53,988 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 179 [2024-11-08 23:10:53,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:10:53,998 INFO L225 Difference]: With dead ends: 137 [2024-11-08 23:10:53,998 INFO L226 Difference]: Without dead ends: 68 [2024-11-08 23:10:54,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:10:54,010 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-08 23:10:54,012 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-08 23:10:54,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-08 23:10:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-08 23:10:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 23:10:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 103 transitions. [2024-11-08 23:10:54,063 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 103 transitions. Word has length 179 [2024-11-08 23:10:54,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:10:54,063 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 103 transitions. [2024-11-08 23:10:54,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 23:10:54,064 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 103 transitions. [2024-11-08 23:10:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 23:10:54,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:10:54,070 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:10:54,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:10:54,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:10:54,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:10:54,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1374340319, now seen corresponding path program 1 times [2024-11-08 23:10:54,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:10:54,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148548096] [2024-11-08 23:10:54,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:54,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:10:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:10:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:10:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:10:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:10:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:10:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:10:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:10:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:10:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:10:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:10:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:10:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:10:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:10:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:10:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:10:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:10:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:10:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:10:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:10:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:10:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:10:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:10:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:10:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:10:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:10:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 23:10:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:10:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 23:10:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:10:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 23:10:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 23:10:54,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:10:54,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148548096] [2024-11-08 23:10:54,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148548096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:10:54,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:10:54,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:10:54,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284366525] [2024-11-08 23:10:54,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:10:54,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:10:54,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:10:54,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:10:54,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:10:54,704 INFO L87 Difference]: Start difference. First operand 68 states and 103 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 23:10:55,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:10:55,009 INFO L93 Difference]: Finished difference Result 209 states and 317 transitions. [2024-11-08 23:10:55,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:10:55,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 179 [2024-11-08 23:10:55,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:10:55,014 INFO L225 Difference]: With dead ends: 209 [2024-11-08 23:10:55,014 INFO L226 Difference]: Without dead ends: 144 [2024-11-08 23:10:55,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:10:55,017 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 62 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:10:55,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 405 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:10:55,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-08 23:10:55,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 131. [2024-11-08 23:10:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 68 states have internal predecessors, (81), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 23:10:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 201 transitions. [2024-11-08 23:10:55,070 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 201 transitions. Word has length 179 [2024-11-08 23:10:55,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:10:55,071 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 201 transitions. [2024-11-08 23:10:55,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 23:10:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 201 transitions. [2024-11-08 23:10:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 23:10:55,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:10:55,075 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:10:55,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:10:55,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:10:55,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:10:55,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2054398689, now seen corresponding path program 1 times [2024-11-08 23:10:55,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:10:55,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664236860] [2024-11-08 23:10:55,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:55,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:10:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:10:55,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:10:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:10:55,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:10:55,391 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:10:55,392 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:10:55,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:10:55,396 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 23:10:55,517 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:10:55,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:10:55 BoogieIcfgContainer [2024-11-08 23:10:55,521 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:10:55,521 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:10:55,521 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:10:55,521 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:10:55,522 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:10:53" (3/4) ... [2024-11-08 23:10:55,524 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:10:55,525 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:10:55,526 INFO L158 Benchmark]: Toolchain (without parser) took 3287.24ms. Allocated memory was 157.3MB in the beginning and 213.9MB in the end (delta: 56.6MB). Free memory was 103.7MB in the beginning and 103.2MB in the end (delta: 473.0kB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2024-11-08 23:10:55,527 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 157.3MB. Free memory was 122.3MB in the beginning and 122.1MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:10:55,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.85ms. Allocated memory is still 157.3MB. Free memory was 103.3MB in the beginning and 88.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:10:55,527 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.93ms. Allocated memory is still 157.3MB. Free memory was 88.7MB in the beginning and 86.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:10:55,528 INFO L158 Benchmark]: Boogie Preprocessor took 50.80ms. Allocated memory is still 157.3MB. Free memory was 86.2MB in the beginning and 83.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:10:55,530 INFO L158 Benchmark]: RCFGBuilder took 425.14ms. Allocated memory is still 157.3MB. Free memory was 83.5MB in the beginning and 65.3MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:10:55,530 INFO L158 Benchmark]: TraceAbstraction took 2393.48ms. Allocated memory was 157.3MB in the beginning and 213.9MB in the end (delta: 56.6MB). Free memory was 64.7MB in the beginning and 103.2MB in the end (delta: -38.5MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-11-08 23:10:55,530 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 213.9MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:10:55,532 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 157.3MB. Free memory was 122.3MB in the beginning and 122.1MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.85ms. Allocated memory is still 157.3MB. Free memory was 103.3MB in the beginning and 88.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.93ms. Allocated memory is still 157.3MB. Free memory was 88.7MB in the beginning and 86.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.80ms. Allocated memory is still 157.3MB. Free memory was 86.2MB in the beginning and 83.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 425.14ms. Allocated memory is still 157.3MB. Free memory was 83.5MB in the beginning and 65.3MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2393.48ms. Allocated memory was 157.3MB in the beginning and 213.9MB in the end (delta: 56.6MB). Free memory was 64.7MB in the beginning and 103.2MB in the end (delta: -38.5MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 213.9MB. Free memory is still 103.2MB. 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 someBinaryDOUBLEComparisonOperation at line 125. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed long int var_1_2 = 8; [L24] signed long int var_1_3 = 63; [L25] signed long int var_1_4 = 16; [L26] signed long int var_1_5 = 127; [L27] unsigned char var_1_9 = 1; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 0; [L30] signed short int var_1_12 = -2; [L31] signed short int var_1_13 = 64; [L32] signed short int var_1_14 = 2; [L33] signed short int var_1_15 = 4; [L34] signed short int var_1_16 = 26204; [L35] signed short int var_1_17 = 5; [L36] signed long int var_1_18 = -5; [L37] signed long int var_1_19 = 100; [L38] signed long int var_1_20 = 0; [L39] signed long int var_1_21 = 128; [L40] signed long int last_1_var_1_18 = -5; VAL [isInitial=0, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=8, var_1_3=63, var_1_4=16, var_1_5=127, var_1_9=1] [L129] isInitial = 1 [L130] FCALL initially() [L131] COND TRUE 1 [L132] CALL updateLastVariables() [L122] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=8, var_1_3=63, var_1_4=16, var_1_5=127, var_1_9=1] [L132] RET updateLastVariables() [L133] CALL updateVariables() [L75] var_1_2 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=63, var_1_4=16, var_1_5=127, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=63, var_1_4=16, var_1_5=127, var_1_9=1] [L76] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=63, var_1_4=16, var_1_5=127, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=63, var_1_4=16, var_1_5=127, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=63, var_1_4=16, var_1_5=127, var_1_9=1] [L77] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=63, var_1_4=16, var_1_5=127, var_1_9=1] [L78] var_1_3 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=127, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=127, var_1_9=1] [L79] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=127, var_1_9=1] [L80] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=127, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=127, var_1_9=1] [L80] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=127, var_1_9=1] [L81] var_1_4 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=127, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=127, var_1_9=1] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=127, var_1_9=1] [L83] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=127, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=127, var_1_9=1] [L83] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=127, var_1_9=1] [L84] var_1_5 = __VERIFIER_nondet_long() [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L86] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L86] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L87] var_1_9 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0] [L88] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0] [L89] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L90] var_1_10 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L91] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L93] var_1_11 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L96] var_1_13 = __VERIFIER_nondet_short() [L97] CALL assume_abort_if_not(var_1_13 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L97] RET assume_abort_if_not(var_1_13 >= -32767) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L98] CALL assume_abort_if_not(var_1_13 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L98] RET assume_abort_if_not(var_1_13 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L99] var_1_14 = __VERIFIER_nondet_short() [L100] CALL assume_abort_if_not(var_1_14 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L100] RET assume_abort_if_not(var_1_14 >= -32767) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L101] CALL assume_abort_if_not(var_1_14 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L101] RET assume_abort_if_not(var_1_14 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L102] var_1_15 = __VERIFIER_nondet_short() [L103] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L103] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L104] CALL assume_abort_if_not(var_1_15 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L104] RET assume_abort_if_not(var_1_15 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L105] var_1_16 = __VERIFIER_nondet_short() [L106] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L106] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L107] CALL assume_abort_if_not(var_1_16 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L107] RET assume_abort_if_not(var_1_16 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L108] var_1_17 = __VERIFIER_nondet_short() [L109] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L109] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L110] CALL assume_abort_if_not(var_1_17 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L110] RET assume_abort_if_not(var_1_17 <= 16383) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L111] var_1_19 = __VERIFIER_nondet_long() [L112] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L112] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L113] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L113] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L114] var_1_20 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L115] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L116] CALL assume_abort_if_not(var_1_20 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L116] RET assume_abort_if_not(var_1_20 <= 536870911) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L117] var_1_21 = __VERIFIER_nondet_long() [L118] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=2147483646, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=2147483646, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L118] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=2147483646, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L119] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=2147483646, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=2147483646, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L119] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=2147483646, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L133] RET updateVariables() [L134] CALL step() [L44] signed long int stepLocal_1 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_1=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=2147483646, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L45] COND FALSE !(stepLocal_1 >= 0) [L48] var_1_12 = ((((var_1_13) > ((var_1_15 - (var_1_16 - var_1_17)))) ? (var_1_13) : ((var_1_15 - (var_1_16 - var_1_17))))) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=2147483646, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L50] signed long int stepLocal_3 = var_1_15 - var_1_19; [L51] signed short int stepLocal_2 = var_1_12; VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_2=4, stepLocal_3=4, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=2147483646, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L52] COND FALSE !(var_1_12 > stepLocal_3) [L57] var_1_18 = var_1_14 VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_2=4, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=2147483646, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L59] signed long int stepLocal_0 = (((var_1_12) > (var_1_18)) ? (var_1_12) : (var_1_18)); VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_0=4, stepLocal_2=4, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=2147483646, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L60] COND FALSE !((((((var_1_2 + var_1_3)) < ((var_1_4 - var_1_5))) ? ((var_1_2 + var_1_3)) : ((var_1_4 - var_1_5)))) != 31.9) [L71] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_0=4, stepLocal_2=4, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=4, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2147483646, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L134] RET step() [L135] CALL, EXPR property() [L125-L126] return ((((((((var_1_2 + var_1_3)) < ((var_1_4 - var_1_5))) ? ((var_1_2 + var_1_3)) : ((var_1_4 - var_1_5)))) != 31.9) ? ((((((var_1_12) > (var_1_18)) ? (var_1_12) : (var_1_18))) < var_1_18) ? (var_1_9 ? (var_1_1 == ((unsigned char) var_1_10)) : (var_1_1 == ((unsigned char) var_1_10))) : (var_1_1 == ((unsigned char) var_1_10))) : (var_1_1 == ((unsigned char) var_1_11))) && ((last_1_var_1_18 >= 0) ? (var_1_12 == ((signed short int) ((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))))) : (var_1_12 == ((signed short int) ((((var_1_13) > ((var_1_15 - (var_1_16 - var_1_17)))) ? (var_1_13) : ((var_1_15 - (var_1_16 - var_1_17))))))))) && ((var_1_12 > (var_1_15 - var_1_19)) ? ((var_1_13 < var_1_12) ? (var_1_18 == ((signed long int) ((var_1_17 + (var_1_16 + var_1_20)) - var_1_21))) : 1) : (var_1_18 == ((signed long int) var_1_14))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=4, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2147483646, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=4, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2147483646, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=-32767, var_1_14=4, var_1_15=4, var_1_16=16383, var_1_17=16383, var_1_18=4, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2147483646, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 508 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 297 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 211 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=2, InterpolantAutomatonStates: 7, 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, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 537 NumberOfCodeBlocks, 537 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 356 ConstructedInterpolants, 0 QuantifiedInterpolants, 556 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 3480/3480 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-08 23:10:55,559 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_floatingpointinfluence_no-floats_file-50.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 d48f2c1830cdd6ac90cdee4bcb795720c0a52828893f188513897f8df44010d8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:10:57,903 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:10:57,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:10:57,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:10:57,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:10:58,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:10:58,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:10:58,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:10:58,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:10:58,024 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:10:58,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:10:58,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:10:58,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:10:58,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:10:58,027 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:10:58,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:10:58,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:10:58,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:10:58,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:10:58,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:10:58,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:10:58,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:10:58,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:10:58,030 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:10:58,030 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:10:58,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:10:58,031 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:10:58,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:10:58,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:10:58,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:10:58,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:10:58,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:10:58,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:10:58,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:10:58,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:10:58,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:10:58,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:10:58,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:10:58,036 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:10:58,036 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:10:58,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:10:58,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:10:58,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:10:58,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:10:58,041 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 -> d48f2c1830cdd6ac90cdee4bcb795720c0a52828893f188513897f8df44010d8 [2024-11-08 23:10:58,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:10:58,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:10:58,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:10:58,423 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:10:58,423 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:10:58,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-50.i [2024-11-08 23:11:00,050 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:11:00,303 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:11:00,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-50.i [2024-11-08 23:11:00,319 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e5ab6fbf/91af8c332efe4d40b703ed9152c3f6e3/FLAG9ef6edad6 [2024-11-08 23:11:00,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e5ab6fbf/91af8c332efe4d40b703ed9152c3f6e3 [2024-11-08 23:11:00,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:11:00,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:11:00,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:11:00,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:11:00,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:11:00,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:11:00" (1/1) ... [2024-11-08 23:11:00,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f00ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00, skipping insertion in model container [2024-11-08 23:11:00,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:11:00" (1/1) ... [2024-11-08 23:11:00,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:11:00,578 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_floatingpointinfluence_no-floats_file-50.i[916,929] [2024-11-08 23:11:00,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:11:00,667 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:11:00,679 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_floatingpointinfluence_no-floats_file-50.i[916,929] [2024-11-08 23:11:00,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:11:00,738 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:11:00,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00 WrapperNode [2024-11-08 23:11:00,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:11:00,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:11:00,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:11:00,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:11:00,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 23:11:00,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 23:11:00,798 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-11-08 23:11:00,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:11:00,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:11:00,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:11:00,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:11:00,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 23:11:00,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 23:11:00,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 23:11:00,842 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-08 23:11:00,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 23:11:00,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 23:11:00,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 23:11:00,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 23:11:00,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 23:11:00,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 23:11:00,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:11:00,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:11:00,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:11:00,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:11:00,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 23:11:00,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:11:00,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:11:00,913 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-08 23:11:00,920 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-08 23:11:00,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:11:00,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:11:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:11:00,963 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:11:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:11:00,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:11:01,061 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:11:01,066 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:11:01,729 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 23:11:01,729 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:11:01,750 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:11:01,751 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:11:01,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:01 BoogieIcfgContainer [2024-11-08 23:11:01,752 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:11:01,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:11:01,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:11:01,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:11:01,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:11:00" (1/3) ... [2024-11-08 23:11:01,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255183da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:11:01, skipping insertion in model container [2024-11-08 23:11:01,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (2/3) ... [2024-11-08 23:11:01,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255183da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:11:01, skipping insertion in model container [2024-11-08 23:11:01,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:01" (3/3) ... [2024-11-08 23:11:01,773 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-50.i [2024-11-08 23:11:01,791 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:11:01,792 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:11:01,867 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:11:01,874 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;@2553bde0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:11:01,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:11:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 23:11:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 23:11:01,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:11:01,894 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:11:01,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:11:01,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:01,900 INFO L85 PathProgramCache]: Analyzing trace with hash -416482401, now seen corresponding path program 1 times [2024-11-08 23:11:01,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:11:01,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308798178] [2024-11-08 23:11:01,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:11:01,917 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-08 23:11:01,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:11:01,921 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-08 23:11:01,922 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-08 23:11:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:02,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:11:02,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:11:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2024-11-08 23:11:02,277 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:11:02,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:11:02,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308798178] [2024-11-08 23:11:02,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308798178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:11:02,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:11:02,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:11:02,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800590403] [2024-11-08 23:11:02,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:11:02,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:11:02,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:11:02,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:11:02,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:11:02,321 INFO L87 Difference]: Start difference. First operand has 72 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 23:11:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:11:02,358 INFO L93 Difference]: Finished difference Result 137 states and 244 transitions. [2024-11-08 23:11:02,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:11:02,361 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 179 [2024-11-08 23:11:02,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:11:02,370 INFO L225 Difference]: With dead ends: 137 [2024-11-08 23:11:02,370 INFO L226 Difference]: Without dead ends: 68 [2024-11-08 23:11:02,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 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-08 23:11:02,381 INFO L432 NwaCegarLoop]: 102 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, 102 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-08 23:11:02,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:11:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-08 23:11:02,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-08 23:11:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 23:11:02,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. [2024-11-08 23:11:02,446 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 102 transitions. Word has length 179 [2024-11-08 23:11:02,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:11:02,446 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 102 transitions. [2024-11-08 23:11:02,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 23:11:02,447 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 102 transitions. [2024-11-08 23:11:02,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 23:11:02,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:11:02,455 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:11:02,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 23:11:02,659 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-08 23:11:02,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:11:02,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:02,661 INFO L85 PathProgramCache]: Analyzing trace with hash -750611210, now seen corresponding path program 1 times [2024-11-08 23:11:02,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:11:02,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724990038] [2024-11-08 23:11:02,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:11:02,663 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-08 23:11:02,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:11:02,666 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-08 23:11:02,667 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-08 23:11:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:02,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:11:02,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:11:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 23:11:03,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:11:03,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:11:03,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724990038] [2024-11-08 23:11:03,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724990038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:11:03,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:11:03,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:11:03,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127906092] [2024-11-08 23:11:03,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:11:03,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:11:03,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:11:03,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:11:03,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:11:03,709 INFO L87 Difference]: Start difference. First operand 68 states and 102 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 23:11:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:11:04,383 INFO L93 Difference]: Finished difference Result 209 states and 313 transitions. [2024-11-08 23:11:04,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:11:04,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 180 [2024-11-08 23:11:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:11:04,393 INFO L225 Difference]: With dead ends: 209 [2024-11-08 23:11:04,393 INFO L226 Difference]: Without dead ends: 144 [2024-11-08 23:11:04,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:11:04,397 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 57 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:11:04,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 399 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 23:11:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-08 23:11:04,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 131. [2024-11-08 23:11:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 68 states have (on average 1.161764705882353) internal successors, (79), 68 states have internal predecessors, (79), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 23:11:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2024-11-08 23:11:04,437 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 180 [2024-11-08 23:11:04,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:11:04,438 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 199 transitions. [2024-11-08 23:11:04,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 23:11:04,438 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 199 transitions. [2024-11-08 23:11:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 23:11:04,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:11:04,441 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:11:04,448 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-08 23:11:04,645 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-08 23:11:04,646 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:11:04,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:04,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1143638220, now seen corresponding path program 1 times [2024-11-08 23:11:04,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:11:04,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462602507] [2024-11-08 23:11:04,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:11:04,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-08 23:11:04,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:11:04,652 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-08 23:11:04,653 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-08 23:11:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:04,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 23:11:04,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:12:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 23:12:19,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:12:19,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:12:19,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462602507] [2024-11-08 23:12:19,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462602507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:12:19,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:12:19,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:12:19,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543931464] [2024-11-08 23:12:19,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:12:19,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:12:19,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:12:19,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:12:19,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:12:19,190 INFO L87 Difference]: Start difference. First operand 131 states and 199 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30)