./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-67.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 8b032f5a857a45b1c2a35099704c59a34a967b916e033a3209200697cb561766 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:24:13,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:24:13,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:24:13,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:24:13,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:24:13,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:24:13,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:24:13,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:24:13,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:24:13,367 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:24:13,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:24:13,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:24:13,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:24:13,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:24:13,371 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:24:13,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:24:13,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:24:13,372 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:24:13,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:24:13,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:24:13,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:24:13,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:24:13,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:24:13,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:24:13,377 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:24:13,377 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:24:13,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:24:13,378 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:24:13,378 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:24:13,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:24:13,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:24:13,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:24:13,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:24:13,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:24:13,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:24:13,379 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:24:13,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:24:13,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:24:13,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:24:13,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:24:13,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:24:13,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:24:13,380 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 -> 8b032f5a857a45b1c2a35099704c59a34a967b916e033a3209200697cb561766 [2024-11-10 03:24:13,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:24:13,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:24:13,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:24:13,628 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:24:13,629 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:24:13,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-67.i [2024-11-10 03:24:14,877 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:24:15,058 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:24:15,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-67.i [2024-11-10 03:24:15,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8a0e163/98bfc9f3625c43c6aa9c1cf223f44ffd/FLAGcc82de55c [2024-11-10 03:24:15,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8a0e163/98bfc9f3625c43c6aa9c1cf223f44ffd [2024-11-10 03:24:15,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:24:15,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:24:15,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:24:15,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:24:15,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:24:15,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:24:15" (1/1) ... [2024-11-10 03:24:15,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f7493df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:15, skipping insertion in model container [2024-11-10 03:24:15,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:24:15" (1/1) ... [2024-11-10 03:24:15,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:24:15,606 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_codestructure_normal_file-67.i[913,926] [2024-11-10 03:24:15,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:24:15,687 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:24:15,706 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_codestructure_normal_file-67.i[913,926] [2024-11-10 03:24:15,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:24:15,742 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:24:15,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:15 WrapperNode [2024-11-10 03:24:15,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:24:15,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:24:15,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:24:15,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:24:15,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:15" (1/1) ... [2024-11-10 03:24:15,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:15" (1/1) ... [2024-11-10 03:24:15,788 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-11-10 03:24:15,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:24:15,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:24:15,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:24:15,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:24:15,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:15" (1/1) ... [2024-11-10 03:24:15,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:15" (1/1) ... [2024-11-10 03:24:15,808 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:15" (1/1) ... [2024-11-10 03:24:15,824 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:24:15,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:15" (1/1) ... [2024-11-10 03:24:15,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:15" (1/1) ... [2024-11-10 03:24:15,833 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:15" (1/1) ... [2024-11-10 03:24:15,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:15" (1/1) ... [2024-11-10 03:24:15,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:15" (1/1) ... [2024-11-10 03:24:15,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:15" (1/1) ... [2024-11-10 03:24:15,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:24:15,843 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:24:15,843 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:24:15,843 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:24:15,844 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:15" (1/1) ... [2024-11-10 03:24:15,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:24:15,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:24:15,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:24:15,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:24:15,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:24:15,923 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:24:15,923 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:24:15,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:24:15,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:24:15,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:24:15,999 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:24:16,001 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:24:16,297 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L135: havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short22#1; [2024-11-10 03:24:16,330 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-10 03:24:16,330 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:24:16,353 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:24:16,353 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:24:16,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:24:16 BoogieIcfgContainer [2024-11-10 03:24:16,354 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:24:16,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:24:16,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:24:16,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:24:16,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:24:15" (1/3) ... [2024-11-10 03:24:16,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c11159a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:24:16, skipping insertion in model container [2024-11-10 03:24:16,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:15" (2/3) ... [2024-11-10 03:24:16,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c11159a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:24:16, skipping insertion in model container [2024-11-10 03:24:16,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:24:16" (3/3) ... [2024-11-10 03:24:16,362 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-67.i [2024-11-10 03:24:16,375 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:24:16,375 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:24:16,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:24:16,448 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;@3634ccc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:24:16,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:24:16,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 59 states have internal predecessors, (80), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 03:24:16,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 03:24:16,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:24:16,475 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:24:16,476 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:24:16,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:24:16,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1683426201, now seen corresponding path program 1 times [2024-11-10 03:24:16,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:24:16,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422771353] [2024-11-10 03:24:16,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:24:16,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:24:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:24:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:24:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:24:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:24:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:24:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:24:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:24:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:24:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:24:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:24:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:24:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:24:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:24:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:24:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:24:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:24:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:24:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:24:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:24:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 03:24:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:24:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 03:24:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:24:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 03:24:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 03:24:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 03:24:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 03:24:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 03:24:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 03:24:16,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:24:16,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422771353] [2024-11-10 03:24:16,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422771353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:24:16,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:24:16,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:24:16,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997410042] [2024-11-10 03:24:16,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:24:16,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:24:16,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:24:16,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:24:16,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:24:16,976 INFO L87 Difference]: Start difference. First operand has 89 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 59 states have internal predecessors, (80), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 03:24:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:24:17,015 INFO L93 Difference]: Finished difference Result 170 states and 293 transitions. [2024-11-10 03:24:17,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:24:17,021 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 174 [2024-11-10 03:24:17,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:24:17,031 INFO L225 Difference]: With dead ends: 170 [2024-11-10 03:24:17,031 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 03:24:17,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:24:17,038 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:24:17,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:24:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 03:24:17,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-10 03:24:17,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 03:24:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 128 transitions. [2024-11-10 03:24:17,154 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 128 transitions. Word has length 174 [2024-11-10 03:24:17,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:24:17,155 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 128 transitions. [2024-11-10 03:24:17,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 03:24:17,155 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 128 transitions. [2024-11-10 03:24:17,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 03:24:17,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:24:17,163 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:24:17,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:24:17,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:24:17,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:24:17,164 INFO L85 PathProgramCache]: Analyzing trace with hash 72344739, now seen corresponding path program 1 times [2024-11-10 03:24:17,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:24:17,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879936557] [2024-11-10 03:24:17,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:24:17,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:24:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:24:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:24:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:24:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:24:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:24:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:24:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:24:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:24:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:24:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:24:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:24:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:24:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:24:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:24:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:24:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:24:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:24:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:24:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:24:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 03:24:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:24:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 03:24:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:24:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 03:24:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 03:24:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 03:24:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 03:24:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 03:24:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-10 03:24:17,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:24:17,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879936557] [2024-11-10 03:24:17,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879936557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:24:17,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470657123] [2024-11-10 03:24:17,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:24:17,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:24:17,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:24:17,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:24:17,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 03:24:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:18,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 03:24:18,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:24:18,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 543 proven. 63 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-11-10 03:24:18,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:24:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-10 03:24:18,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470657123] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:24:18,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 03:24:18,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-10 03:24:18,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831518316] [2024-11-10 03:24:18,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 03:24:18,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 03:24:18,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:24:18,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 03:24:18,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-10 03:24:18,627 INFO L87 Difference]: Start difference. First operand 84 states and 128 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-10 03:24:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:24:18,901 INFO L93 Difference]: Finished difference Result 169 states and 254 transitions. [2024-11-10 03:24:18,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:24:18,906 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 174 [2024-11-10 03:24:18,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:24:18,908 INFO L225 Difference]: With dead ends: 169 [2024-11-10 03:24:18,908 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 03:24:18,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-11-10 03:24:18,909 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 191 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:24:18,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 186 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:24:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 03:24:18,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-11-10 03:24:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 03:24:18,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 123 transitions. [2024-11-10 03:24:18,924 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 123 transitions. Word has length 174 [2024-11-10 03:24:18,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:24:18,925 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 123 transitions. [2024-11-10 03:24:18,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-10 03:24:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 123 transitions. [2024-11-10 03:24:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 03:24:18,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:24:18,932 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:24:18,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 03:24:19,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:24:19,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:24:19,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:24:19,133 INFO L85 PathProgramCache]: Analyzing trace with hash -882529656, now seen corresponding path program 1 times [2024-11-10 03:24:19,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:24:19,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88634104] [2024-11-10 03:24:19,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:24:19,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:24:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:24:19,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272355436] [2024-11-10 03:24:19,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:24:19,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:24:19,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:24:19,193 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:24:19,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 03:24:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:24:19,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:24:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:24:19,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:24:19,434 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:24:19,435 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:24:19,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 03:24:19,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-10 03:24:19,642 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 03:24:19,748 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:24:19,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:24:19 BoogieIcfgContainer [2024-11-10 03:24:19,751 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:24:19,751 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:24:19,752 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:24:19,752 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:24:19,752 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:24:16" (3/4) ... [2024-11-10 03:24:19,754 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:24:19,755 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:24:19,756 INFO L158 Benchmark]: Toolchain (without parser) took 4317.15ms. Allocated memory was 146.8MB in the beginning and 234.9MB in the end (delta: 88.1MB). Free memory was 76.3MB in the beginning and 195.8MB in the end (delta: -119.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:24:19,756 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 146.8MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:24:19,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.84ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 76.2MB in the beginning and 165.8MB in the end (delta: -89.6MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2024-11-10 03:24:19,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.03ms. Allocated memory is still 195.0MB. Free memory was 165.8MB in the beginning and 162.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 03:24:19,760 INFO L158 Benchmark]: Boogie Preprocessor took 48.65ms. Allocated memory is still 195.0MB. Free memory was 162.6MB in the beginning and 158.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:24:19,760 INFO L158 Benchmark]: IcfgBuilder took 511.17ms. Allocated memory is still 195.0MB. Free memory was 158.5MB in the beginning and 134.3MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 03:24:19,761 INFO L158 Benchmark]: TraceAbstraction took 3394.51ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 133.3MB in the beginning and 195.8MB in the end (delta: -62.5MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB. [2024-11-10 03:24:19,761 INFO L158 Benchmark]: Witness Printer took 4.03ms. Allocated memory is still 234.9MB. Free memory is still 195.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:24:19,762 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.11ms. Allocated memory is still 146.8MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.84ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 76.2MB in the beginning and 165.8MB in the end (delta: -89.6MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.03ms. Allocated memory is still 195.0MB. Free memory was 165.8MB in the beginning and 162.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.65ms. Allocated memory is still 195.0MB. Free memory was 162.6MB in the beginning and 158.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 511.17ms. Allocated memory is still 195.0MB. Free memory was 158.5MB in the beginning and 134.3MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3394.51ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 133.3MB in the beginning and 195.8MB in the end (delta: -62.5MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB. * Witness Printer took 4.03ms. Allocated memory is still 234.9MB. Free memory is still 195.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryArithmeticDOUBLEoperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someUnaryFLOAToperation at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9.75; [L23] signed long int var_1_2 = 100; [L24] unsigned char var_1_3 = 1; [L25] signed long int var_1_4 = 25; [L26] signed long int var_1_5 = 10; [L27] unsigned char var_1_6 = 1; [L28] float var_1_7 = 7.5; [L29] signed long int var_1_8 = -1000; [L30] float var_1_9 = 9.25; [L31] float var_1_10 = 64.5; [L32] float var_1_11 = 16.25; [L33] signed char var_1_12 = 2; [L34] signed char var_1_13 = 8; [L35] signed char var_1_14 = 0; [L36] float var_1_15 = 0.6; [L37] signed char var_1_16 = 32; [L38] unsigned short int var_1_17 = 2; [L39] unsigned char var_1_18 = 1; [L40] unsigned short int var_1_19 = 63241; [L41] unsigned short int var_1_20 = 58697; [L42] unsigned short int var_1_21 = 25516; [L43] unsigned long int var_1_22 = 3301682525; VAL [isInitial=0, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=100, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] FCALL updateLastVariables() [L143] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_long() [L89] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L89] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L90] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L90] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L91] var_1_4 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L92] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L93] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L93] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L94] var_1_5 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L95] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L96] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L96] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L97] var_1_6 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L98] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L99] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L99] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L100] var_1_8 = __VERIFIER_nondet_long() [L101] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=37/4] [L101] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=37/4] [L102] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=37/4] [L102] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=37/4] [L103] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=37/4] [L103] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=37/4] [L104] var_1_9 = __VERIFIER_nondet_float() [L105] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L105] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L106] var_1_10 = __VERIFIER_nondet_float() [L107] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L107] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L108] var_1_11 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L109] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L110] var_1_13 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L111] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L112] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L112] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L113] var_1_14 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L114] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L115] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L115] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L116] var_1_18 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L117] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L118] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L118] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L119] var_1_19 = __VERIFIER_nondet_ushort() [L120] CALL assume_abort_if_not(var_1_19 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L120] RET assume_abort_if_not(var_1_19 >= 32767) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L121] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L121] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L122] var_1_20 = __VERIFIER_nondet_ushort() [L123] CALL assume_abort_if_not(var_1_20 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L123] RET assume_abort_if_not(var_1_20 >= 32767) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L124] CALL assume_abort_if_not(var_1_20 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L124] RET assume_abort_if_not(var_1_20 <= 65534) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=25516, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L125] var_1_21 = __VERIFIER_nondet_ushort() [L126] CALL assume_abort_if_not(var_1_21 >= 24575) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L126] RET assume_abort_if_not(var_1_21 >= 24575) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L127] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L127] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=3301682525, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L128] var_1_22 = __VERIFIER_nondet_ulong() [L129] CALL assume_abort_if_not(var_1_22 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L129] RET assume_abort_if_not(var_1_22 >= 2147483647) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L130] CALL assume_abort_if_not(var_1_22 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L130] RET assume_abort_if_not(var_1_22 <= 4294967295) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_1=39/4, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L143] RET updateVariables() [L144] CALL step() [L47] COND TRUE 50 != var_1_2 [L48] var_1_1 = (1.00000000000025E12 - 24.25) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L50] var_1_3 = (((5 - var_1_4) <= (var_1_2 + var_1_5)) || var_1_6) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L51] COND FALSE !(((var_1_2 + 100) / var_1_8) >= var_1_5) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101] [L58] var_1_12 = (var_1_13 - var_1_14) [L59] var_1_15 = ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=0] [L60] COND FALSE !(var_1_1 > (var_1_11 + var_1_7)) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=0] [L69] COND TRUE \read(var_1_3) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=0] [L70] COND TRUE \read(var_1_6) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=0] [L71] COND TRUE \read(var_1_18) [L72] var_1_17 = var_1_14 VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=0, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=0] [L144] RET step() [L145] CALL, EXPR property() [L135] EXPR ((((((50 != var_1_2) ? (var_1_1 == ((double) (1.00000000000025E12 - 24.25))) : 1) && (var_1_3 == ((unsigned char) (((5 - var_1_4) <= (var_1_2 + var_1_5)) || var_1_6)))) && ((((var_1_2 + 100) / var_1_8) >= var_1_5) ? ((var_1_3 || (var_1_5 > (var_1_4 * var_1_8))) ? (var_1_7 == ((float) var_1_9)) : (var_1_7 == ((float) (var_1_10 + var_1_11)))) : 1)) && (var_1_12 == ((signed char) (var_1_13 - var_1_14)))) && (var_1_15 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && ((var_1_1 > (var_1_11 + var_1_7)) ? ((var_1_14 < (((((var_1_13) > (var_1_4)) ? (var_1_13) : (var_1_4))) | var_1_2)) ? (var_1_3 ? (var_1_16 == ((signed char) -2)) : 1) : (var_1_16 == ((signed char) var_1_13))) : 1) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=0, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=0] [L135-L136] return (((((((50 != var_1_2) ? (var_1_1 == ((double) (1.00000000000025E12 - 24.25))) : 1) && (var_1_3 == ((unsigned char) (((5 - var_1_4) <= (var_1_2 + var_1_5)) || var_1_6)))) && ((((var_1_2 + 100) / var_1_8) >= var_1_5) ? ((var_1_3 || (var_1_5 > (var_1_4 * var_1_8))) ? (var_1_7 == ((float) var_1_9)) : (var_1_7 == ((float) (var_1_10 + var_1_11)))) : 1)) && (var_1_12 == ((signed char) (var_1_13 - var_1_14)))) && (var_1_15 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && ((var_1_1 > (var_1_11 + var_1_7)) ? ((var_1_14 < (((((var_1_13) > (var_1_4)) ? (var_1_13) : (var_1_4))) | var_1_2)) ? (var_1_3 ? (var_1_16 == ((signed char) -2)) : 1) : (var_1_16 == ((signed char) var_1_13))) : 1)) && (var_1_3 ? (var_1_6 ? (var_1_18 ? (var_1_17 == ((unsigned short int) var_1_14)) : (var_1_17 == ((unsigned short int) (((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))) - ((var_1_21 - 256) - 256))))) : (((var_1_22 - var_1_20) > (var_1_4 / var_1_8)) ? ((var_1_15 >= var_1_10) ? (var_1_17 == ((unsigned short int) var_1_14)) : 1) : 1)) : (var_1_17 == ((unsigned short int) var_1_21))) ; [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=0, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=0, var_1_18=1, var_1_19=32768, var_1_20=32767, var_1_21=24575, var_1_22=2147483647, var_1_2=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=101, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 3, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 219 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 312 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 184 IncrementalHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 207 mSDtfsCounter, 184 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 500 GetRequests, 486 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, InterpolantAutomatonStates: 11, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 874 NumberOfCodeBlocks, 874 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 692 ConstructedInterpolants, 0 QuantifiedInterpolants, 1550 SizeOfPredicates, 4 NumberOfNonLiveVariables, 375 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 5859/6048 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 03:24:19,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_codestructure_normal_file-67.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 8b032f5a857a45b1c2a35099704c59a34a967b916e033a3209200697cb561766 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:24:21,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:24:21,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:24:21,792 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:24:21,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:24:21,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:24:21,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:24:21,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:24:21,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:24:21,822 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:24:21,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:24:21,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:24:21,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:24:21,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:24:21,825 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:24:21,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:24:21,826 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:24:21,826 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:24:21,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:24:21,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:24:21,826 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:24:21,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:24:21,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:24:21,827 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:24:21,827 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:24:21,827 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:24:21,827 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:24:21,828 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:24:21,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:24:21,828 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:24:21,828 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:24:21,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:24:21,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:24:21,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:24:21,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:24:21,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:24:21,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:24:21,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:24:21,829 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:24:21,829 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:24:21,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:24:21,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:24:21,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:24:21,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:24:21,832 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 -> 8b032f5a857a45b1c2a35099704c59a34a967b916e033a3209200697cb561766 [2024-11-10 03:24:22,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:24:22,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:24:22,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:24:22,130 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:24:22,130 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:24:22,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-67.i [2024-11-10 03:24:23,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:24:23,737 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:24:23,738 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-67.i [2024-11-10 03:24:23,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e50b5a66/da0429f1075049aa970d468aa0fa96d3/FLAG60973cf3c [2024-11-10 03:24:23,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e50b5a66/da0429f1075049aa970d468aa0fa96d3 [2024-11-10 03:24:23,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:24:23,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:24:23,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:24:23,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:24:23,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:24:23,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:24:23" (1/1) ... [2024-11-10 03:24:23,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4544d5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:23, skipping insertion in model container [2024-11-10 03:24:23,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:24:23" (1/1) ... [2024-11-10 03:24:23,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:24:23,948 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_codestructure_normal_file-67.i[913,926] [2024-11-10 03:24:24,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:24:24,032 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:24:24,058 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_codestructure_normal_file-67.i[913,926] [2024-11-10 03:24:24,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:24:24,101 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:24:24,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:24 WrapperNode [2024-11-10 03:24:24,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:24:24,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:24:24,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:24:24,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:24:24,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:24" (1/1) ... [2024-11-10 03:24:24,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:24" (1/1) ... [2024-11-10 03:24:24,145 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2024-11-10 03:24:24,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:24:24,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:24:24,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:24:24,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:24:24,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:24" (1/1) ... [2024-11-10 03:24:24,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:24" (1/1) ... [2024-11-10 03:24:24,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:24" (1/1) ... [2024-11-10 03:24:24,182 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:24:24,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:24" (1/1) ... [2024-11-10 03:24:24,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:24" (1/1) ... [2024-11-10 03:24:24,193 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:24" (1/1) ... [2024-11-10 03:24:24,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:24" (1/1) ... [2024-11-10 03:24:24,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:24" (1/1) ... [2024-11-10 03:24:24,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:24" (1/1) ... [2024-11-10 03:24:24,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:24:24,201 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:24:24,201 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:24:24,201 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:24:24,202 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:24" (1/1) ... [2024-11-10 03:24:24,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:24:24,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:24:24,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:24:24,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:24:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:24:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:24:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:24:24,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:24:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:24:24,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:24:24,362 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:24:24,365 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:24:26,430 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:24:26,439 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:24:26,455 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:24:26,455 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:24:26,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:24:26 BoogieIcfgContainer [2024-11-10 03:24:26,456 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:24:26,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:24:26,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:24:26,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:24:26,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:24:23" (1/3) ... [2024-11-10 03:24:26,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4820b2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:24:26, skipping insertion in model container [2024-11-10 03:24:26,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:24" (2/3) ... [2024-11-10 03:24:26,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4820b2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:24:26, skipping insertion in model container [2024-11-10 03:24:26,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:24:26" (3/3) ... [2024-11-10 03:24:26,463 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-67.i [2024-11-10 03:24:26,478 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:24:26,478 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:24:26,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:24:26,537 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;@1ed4f35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:24:26,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:24:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 03:24:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-10 03:24:26,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:24:26,560 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:24:26,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:24:26,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:24:26,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1220040563, now seen corresponding path program 1 times [2024-11-10 03:24:26,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:24:26,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415073060] [2024-11-10 03:24:26,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:24:26,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:24:26,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:24:26,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:24:26,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 03:24:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:26,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:24:26,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:24:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-11-10 03:24:26,959 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:24:26,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:24:26,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415073060] [2024-11-10 03:24:26,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415073060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:24:26,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:24:26,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:24:26,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206681948] [2024-11-10 03:24:26,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:24:26,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:24:26,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:24:26,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:24:26,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:24:26,999 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 03:24:27,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:24:27,028 INFO L93 Difference]: Finished difference Result 148 states and 259 transitions. [2024-11-10 03:24:27,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:24:27,030 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 172 [2024-11-10 03:24:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:24:27,038 INFO L225 Difference]: With dead ends: 148 [2024-11-10 03:24:27,038 INFO L226 Difference]: Without dead ends: 73 [2024-11-10 03:24:27,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:24:27,047 INFO L432 NwaCegarLoop]: 111 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, 111 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:24:27,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:24:27,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-10 03:24:27,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-10 03:24:27,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 03:24:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2024-11-10 03:24:27,089 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 172 [2024-11-10 03:24:27,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:24:27,090 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2024-11-10 03:24:27,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 03:24:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2024-11-10 03:24:27,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-10 03:24:27,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:24:27,093 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:24:27,103 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-10 03:24:27,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:24:27,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:24:27,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:24:27,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1905665711, now seen corresponding path program 1 times [2024-11-10 03:24:27,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:24:27,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920153830] [2024-11-10 03:24:27,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:24:27,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:24:27,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:24:27,298 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:24:27,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 03:24:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:27,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 03:24:27,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:24:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 543 proven. 63 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-11-10 03:24:28,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:24:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-10 03:24:28,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:24:28,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920153830] [2024-11-10 03:24:28,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920153830] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:24:28,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:24:28,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-10 03:24:28,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569283694] [2024-11-10 03:24:28,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 03:24:28,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 03:24:28,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:24:28,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 03:24:28,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:24:28,773 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-10 03:24:30,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:24:30,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:24:30,683 INFO L93 Difference]: Finished difference Result 147 states and 220 transitions. [2024-11-10 03:24:30,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:24:30,706 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 172 [2024-11-10 03:24:30,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:24:30,708 INFO L225 Difference]: With dead ends: 147 [2024-11-10 03:24:30,708 INFO L226 Difference]: Without dead ends: 77 [2024-11-10 03:24:30,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 335 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-11-10 03:24:30,710 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 136 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 03:24:30,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 143 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 03:24:30,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-10 03:24:30,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2024-11-10 03:24:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 03:24:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 106 transitions. [2024-11-10 03:24:30,725 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 106 transitions. Word has length 172 [2024-11-10 03:24:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:24:30,725 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 106 transitions. [2024-11-10 03:24:30,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-10 03:24:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 106 transitions. [2024-11-10 03:24:30,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 03:24:30,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:24:30,728 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:24:30,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 03:24:30,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:24:30,929 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:24:30,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:24:30,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1143754772, now seen corresponding path program 1 times [2024-11-10 03:24:30,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:24:30,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992275416] [2024-11-10 03:24:30,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:24:30,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:24:30,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:24:30,934 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:24:30,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 03:24:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:31,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 03:24:31,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:25:20,617 WARN L286 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)