./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-0.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 919b64ad06374025a27f1e638c1fbab266347de62a505876fcba854b54111d09 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:21:08,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:21:08,590 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:21:08,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:21:08,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:21:08,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:21:08,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:21:08,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:21:08,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:21:08,630 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:21:08,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:21:08,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:21:08,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:21:08,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:21:08,633 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:21:08,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:21:08,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:21:08,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:21:08,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:21:08,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:21:08,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:21:08,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:21:08,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:21:08,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:21:08,641 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:21:08,641 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:21:08,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:21:08,641 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:21:08,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:21:08,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:21:08,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:21:08,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:21:08,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:21:08,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:21:08,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:21:08,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:21:08,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:21:08,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:21:08,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:21:08,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:21:08,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:21:08,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:21:08,647 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 -> 919b64ad06374025a27f1e638c1fbab266347de62a505876fcba854b54111d09 [2024-10-24 06:21:08,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:21:08,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:21:08,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:21:08,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:21:08,946 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:21:08,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-0.i [2024-10-24 06:21:10,633 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:21:10,849 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:21:10,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-0.i [2024-10-24 06:21:10,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dceb34c5e/9bd64820c61c4b44b88d9f35197ee33a/FLAGbc626e640 [2024-10-24 06:21:10,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dceb34c5e/9bd64820c61c4b44b88d9f35197ee33a [2024-10-24 06:21:10,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:21:10,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:21:10,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:21:10,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:21:10,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:21:10,891 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:21:10" (1/1) ... [2024-10-24 06:21:10,892 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ef2711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:10, skipping insertion in model container [2024-10-24 06:21:10,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:21:10" (1/1) ... [2024-10-24 06:21:10,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:21:11,129 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-0.i[914,927] [2024-10-24 06:21:11,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:21:11,240 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:21:11,253 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-0.i[914,927] [2024-10-24 06:21:11,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:21:11,315 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:21:11,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:11 WrapperNode [2024-10-24 06:21:11,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:21:11,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:21:11,317 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:21:11,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:21:11,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:11" (1/1) ... [2024-10-24 06:21:11,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:11" (1/1) ... [2024-10-24 06:21:11,395 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-10-24 06:21:11,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:21:11,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:21:11,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:21:11,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:21:11,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:11" (1/1) ... [2024-10-24 06:21:11,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:11" (1/1) ... [2024-10-24 06:21:11,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:11" (1/1) ... [2024-10-24 06:21:11,446 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-10-24 06:21:11,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:11" (1/1) ... [2024-10-24 06:21:11,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:11" (1/1) ... [2024-10-24 06:21:11,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:11" (1/1) ... [2024-10-24 06:21:11,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:11" (1/1) ... [2024-10-24 06:21:11,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:11" (1/1) ... [2024-10-24 06:21:11,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:11" (1/1) ... [2024-10-24 06:21:11,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:21:11,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:21:11,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:21:11,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:21:11,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:11" (1/1) ... [2024-10-24 06:21:11,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:21:11,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:21:11,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:21:11,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:21:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:21:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:21:11,582 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:21:11,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:21:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:21:11,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:21:11,821 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:21:11,825 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:21:12,214 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 06:21:12,215 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:21:12,279 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:21:12,280 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:21:12,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:21:12 BoogieIcfgContainer [2024-10-24 06:21:12,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:21:12,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:21:12,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:21:12,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:21:12,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:21:10" (1/3) ... [2024-10-24 06:21:12,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b8e210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:21:12, skipping insertion in model container [2024-10-24 06:21:12,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:11" (2/3) ... [2024-10-24 06:21:12,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b8e210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:21:12, skipping insertion in model container [2024-10-24 06:21:12,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:21:12" (3/3) ... [2024-10-24 06:21:12,289 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-0.i [2024-10-24 06:21:12,306 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:21:12,307 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:21:12,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:21:12,397 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;@59e9504b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:21:12,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:21:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 06:21:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 06:21:12,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:12,420 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:12,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:12,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:12,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1063738640, now seen corresponding path program 1 times [2024-10-24 06:21:12,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:21:12,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828178320] [2024-10-24 06:21:12,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:12,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:21:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:21:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:21:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:21:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:21:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:21:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:21:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:21:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:21:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:21:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:21:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:21:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:21:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:21:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:21:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:21:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:21:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:21:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:21:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 06:21:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:21:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 06:21:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:21:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 06:21:12,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:21:12,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828178320] [2024-10-24 06:21:12,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828178320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:21:12,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:21:12,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:21:12,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823437949] [2024-10-24 06:21:12,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:21:12,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:21:12,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:21:12,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:21:12,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:21:12,955 INFO L87 Difference]: Start difference. First operand has 68 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 06:21:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:21:13,009 INFO L93 Difference]: Finished difference Result 133 states and 234 transitions. [2024-10-24 06:21:13,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:21:13,013 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2024-10-24 06:21:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:21:13,022 INFO L225 Difference]: With dead ends: 133 [2024-10-24 06:21:13,023 INFO L226 Difference]: Without dead ends: 66 [2024-10-24 06:21:13,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:21:13,030 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:21:13,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:21:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-24 06:21:13,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-24 06:21:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 06:21:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2024-10-24 06:21:13,076 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 144 [2024-10-24 06:21:13,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:21:13,077 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2024-10-24 06:21:13,077 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 06:21:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-10-24 06:21:13,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 06:21:13,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:13,081 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:13,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:21:13,082 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:13,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash -939470980, now seen corresponding path program 1 times [2024-10-24 06:21:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:21:13,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861318673] [2024-10-24 06:21:13,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:13,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:21:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:21:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:21:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:21:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:21:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:21:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:21:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:21:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:21:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:21:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:21:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:21:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:21:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:21:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:21:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:21:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:21:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:21:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:21:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 06:21:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:21:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 06:21:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:21:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 06:21:13,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:21:13,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861318673] [2024-10-24 06:21:13,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861318673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:21:13,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:21:13,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:21:13,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524741597] [2024-10-24 06:21:13,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:21:13,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:21:13,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:21:13,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:21:13,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:21:13,927 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 06:21:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:21:14,272 INFO L93 Difference]: Finished difference Result 197 states and 305 transitions. [2024-10-24 06:21:14,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:21:14,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-24 06:21:14,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:21:14,276 INFO L225 Difference]: With dead ends: 197 [2024-10-24 06:21:14,276 INFO L226 Difference]: Without dead ends: 132 [2024-10-24 06:21:14,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:21:14,278 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 65 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:21:14,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 328 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:21:14,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-24 06:21:14,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 116. [2024-10-24 06:21:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 06:21:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 181 transitions. [2024-10-24 06:21:14,336 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 181 transitions. Word has length 144 [2024-10-24 06:21:14,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:21:14,337 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 181 transitions. [2024-10-24 06:21:14,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 06:21:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 181 transitions. [2024-10-24 06:21:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 06:21:14,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:14,343 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:14,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:21:14,343 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:14,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:14,344 INFO L85 PathProgramCache]: Analyzing trace with hash -681305542, now seen corresponding path program 1 times [2024-10-24 06:21:14,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:21:14,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128916550] [2024-10-24 06:21:14,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:14,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:21:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:21:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:21:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:21:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:21:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:21:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:21:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:21:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:21:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:21:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:21:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:21:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:21:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:21:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:21:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:21:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:21:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:21:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:21:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 06:21:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:14,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:21:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:15,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 06:21:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:15,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:21:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:15,020 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 06:21:15,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:21:15,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128916550] [2024-10-24 06:21:15,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128916550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:21:15,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:21:15,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:21:15,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052816157] [2024-10-24 06:21:15,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:21:15,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:21:15,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:21:15,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:21:15,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:21:15,027 INFO L87 Difference]: Start difference. First operand 116 states and 181 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 06:21:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:21:15,223 INFO L93 Difference]: Finished difference Result 262 states and 404 transitions. [2024-10-24 06:21:15,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:21:15,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-24 06:21:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:21:15,228 INFO L225 Difference]: With dead ends: 262 [2024-10-24 06:21:15,229 INFO L226 Difference]: Without dead ends: 194 [2024-10-24 06:21:15,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:21:15,231 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 100 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:21:15,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 296 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:21:15,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-24 06:21:15,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 179. [2024-10-24 06:21:15,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 109 states have (on average 1.348623853211009) internal successors, (147), 109 states have internal predecessors, (147), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-24 06:21:15,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 279 transitions. [2024-10-24 06:21:15,260 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 279 transitions. Word has length 144 [2024-10-24 06:21:15,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:21:15,261 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 279 transitions. [2024-10-24 06:21:15,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 06:21:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 279 transitions. [2024-10-24 06:21:15,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 06:21:15,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:15,264 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:15,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:21:15,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:15,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:15,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1961169220, now seen corresponding path program 1 times [2024-10-24 06:21:15,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:21:15,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821181194] [2024-10-24 06:21:15,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:15,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:21:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:21:15,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1168002516] [2024-10-24 06:21:15,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:15,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:21:15,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:21:15,406 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-10-24 06:21:15,411 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-10-24 06:21:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:21:15,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:21:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:21:15,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:21:15,700 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:21:15,701 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:21:15,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 06:21:15,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:21:15,910 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 06:21:16,049 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:21:16,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:21:16 BoogieIcfgContainer [2024-10-24 06:21:16,056 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:21:16,057 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:21:16,057 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:21:16,057 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:21:16,057 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:21:12" (3/4) ... [2024-10-24 06:21:16,059 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:21:16,060 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:21:16,062 INFO L158 Benchmark]: Toolchain (without parser) took 5179.36ms. Allocated memory was 167.8MB in the beginning and 222.3MB in the end (delta: 54.5MB). Free memory was 101.1MB in the beginning and 70.4MB in the end (delta: 30.7MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. [2024-10-24 06:21:16,063 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 113.2MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:21:16,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.29ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 84.9MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 06:21:16,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.71ms. Allocated memory is still 167.8MB. Free memory was 84.9MB in the beginning and 82.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:21:16,064 INFO L158 Benchmark]: Boogie Preprocessor took 80.92ms. Allocated memory is still 167.8MB. Free memory was 82.0MB in the beginning and 78.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 06:21:16,064 INFO L158 Benchmark]: RCFGBuilder took 802.67ms. Allocated memory is still 167.8MB. Free memory was 78.7MB in the beginning and 118.5MB in the end (delta: -39.8MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-10-24 06:21:16,064 INFO L158 Benchmark]: TraceAbstraction took 3773.49ms. Allocated memory was 167.8MB in the beginning and 222.3MB in the end (delta: 54.5MB). Free memory was 117.7MB in the beginning and 71.5MB in the end (delta: 46.2MB). Peak memory consumption was 102.4MB. Max. memory is 16.1GB. [2024-10-24 06:21:16,065 INFO L158 Benchmark]: Witness Printer took 3.89ms. Allocated memory is still 222.3MB. Free memory was 71.5MB in the beginning and 70.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 06:21:16,066 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 113.2MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.29ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 84.9MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.71ms. Allocated memory is still 167.8MB. Free memory was 84.9MB in the beginning and 82.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.92ms. Allocated memory is still 167.8MB. Free memory was 82.0MB in the beginning and 78.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 802.67ms. Allocated memory is still 167.8MB. Free memory was 78.7MB in the beginning and 118.5MB in the end (delta: -39.8MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3773.49ms. Allocated memory was 167.8MB in the beginning and 222.3MB in the end (delta: 54.5MB). Free memory was 117.7MB in the beginning and 71.5MB in the end (delta: 46.2MB). Peak memory consumption was 102.4MB. Max. memory is 16.1GB. * Witness Printer took 3.89ms. Allocated memory is still 222.3MB. Free memory was 71.5MB in the beginning and 70.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 163, overapproximation of someBinaryFLOATComparisonOperation at line 163, overapproximation of someUnaryDOUBLEoperation at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 0; [L23] signed long int var_1_5 = 2; [L24] signed short int var_1_6 = -10; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned long int var_1_9 = 3470417420; [L28] unsigned char var_1_10 = 0; [L29] double var_1_12 = 25.6; [L30] double var_1_13 = 1.75; [L31] float var_1_14 = 5.4; [L32] float var_1_15 = 127.5; [L33] float var_1_16 = 3.5; [L34] signed long int var_1_17 = 64; [L35] double var_1_19 = 0.0; [L36] unsigned short int var_1_20 = 10; [L37] double var_1_21 = 31.2; [L38] signed short int var_1_22 = 1000; [L39] signed long int var_1_23 = 50; [L40] signed short int var_1_24 = -32; [L41] unsigned char var_1_25 = 8; [L42] double var_1_26 = 1.25; [L43] unsigned char var_1_27 = 32; [L44] signed short int var_1_28 = -4; [L45] unsigned char var_1_29 = 0; [L46] signed long int last_1_var_1_1 = 0; [L47] signed long int last_1_var_1_5 = 2; [L48] signed short int last_1_var_1_6 = -10; [L49] unsigned long int last_1_var_1_7 = 1; [L50] float last_1_var_1_14 = 5.4; [L51] signed long int last_1_var_1_17 = 64; [L167] isInitial = 1 [L168] FCALL initially() [L169] COND TRUE 1 [L170] CALL updateLastVariables() [L155] last_1_var_1_1 = var_1_1 [L156] last_1_var_1_5 = var_1_5 [L157] last_1_var_1_6 = var_1_6 [L158] last_1_var_1_7 = var_1_7 [L159] last_1_var_1_14 = var_1_14 [L160] last_1_var_1_17 = var_1_17 [L170] RET updateLastVariables() [L171] CALL updateVariables() [L118] var_1_9 = __VERIFIER_nondet_ulong() [L119] CALL assume_abort_if_not(var_1_9 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L119] RET assume_abort_if_not(var_1_9 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L120] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L120] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L121] var_1_10 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L122] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L123] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L123] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L124] var_1_12 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L125] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L126] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L126] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L127] var_1_13 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L128] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L129] var_1_15 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L130] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L131] var_1_16 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L132] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L133] var_1_20 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L134] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L135] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L135] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L136] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L136] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L137] var_1_21 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L138] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L139] var_1_23 = __VERIFIER_nondet_long() [L140] CALL assume_abort_if_not(var_1_23 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L140] RET assume_abort_if_not(var_1_23 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L141] CALL assume_abort_if_not(var_1_23 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L141] RET assume_abort_if_not(var_1_23 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L142] var_1_24 = __VERIFIER_nondet_short() [L143] CALL assume_abort_if_not(var_1_24 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L143] RET assume_abort_if_not(var_1_24 >= -32767) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L144] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L144] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L145] var_1_26 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L146] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L147] var_1_27 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L148] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L149] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L149] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L150] var_1_29 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=127, var_1_28=-4, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=127, var_1_28=-4, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L151] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=127, var_1_28=-4, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L152] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L152] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L171] RET updateVariables() [L172] CALL step() [L55] COND TRUE (32 / var_1_20) > -500 [L56] var_1_19 = ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L58] COND FALSE !((~ var_1_20) >= var_1_23) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L65] COND TRUE var_1_21 <= ((((var_1_19) > (var_1_26)) ? (var_1_19) : (var_1_26))) [L66] var_1_25 = (var_1_27 + 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=128, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L68] COND FALSE !((var_1_23 / var_1_20) > var_1_25) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=128, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L75] COND FALSE !(last_1_var_1_7 > (- last_1_var_1_5)) [L78] var_1_1 = (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=128, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L80] COND TRUE ((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16))) [L81] var_1_17 = ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=128, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L85] signed long int stepLocal_1 = - last_1_var_1_1; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_1=0, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=128, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L86] COND FALSE !(last_1_var_1_17 < stepLocal_1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=128, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L89] signed long int stepLocal_3 = var_1_1; [L90] signed long int stepLocal_2 = var_1_17; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_2=0, stepLocal_3=0, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=128, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L91] COND FALSE !(var_1_17 > stepLocal_2) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=128, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L96] unsigned long int stepLocal_5 = var_1_9; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-17, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=128, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L97] COND FALSE !((var_1_12 * last_1_var_1_14) > var_1_13) [L104] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-17, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=128, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L106] signed long int stepLocal_0 = var_1_17; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=-17, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=128, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L107] COND TRUE var_1_6 < stepLocal_0 [L108] var_1_5 = ((var_1_17 - var_1_6) + var_1_6) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-17, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=128, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L110] unsigned long int stepLocal_4 = var_1_9 - var_1_6; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_4=-7, stepLocal_5=-17, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=128, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L111] COND FALSE !((- 8u) >= stepLocal_4) [L114] var_1_8 = (((var_1_14 / var_1_12) >= var_1_14) || var_1_10) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-17, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=128, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=1, var_1_9=-17] [L172] RET step() [L173] CALL, EXPR property() [L163-L164] return (((((((last_1_var_1_7 > (- last_1_var_1_5)) ? (var_1_1 == ((signed long int) ((((last_1_var_1_5) > ((last_1_var_1_7 + last_1_var_1_6))) ? (last_1_var_1_5) : ((last_1_var_1_7 + last_1_var_1_6)))))) : (var_1_1 == ((signed long int) (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16)))))) && ((var_1_6 < var_1_17) ? (var_1_5 == ((signed long int) ((var_1_17 - var_1_6) + var_1_6))) : 1)) && ((last_1_var_1_17 < (- last_1_var_1_1)) ? (var_1_6 == ((signed short int) (32 - last_1_var_1_6))) : 1)) && ((var_1_17 > var_1_17) ? ((var_1_6 <= var_1_1) ? (var_1_7 == ((unsigned long int) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : 1) : 1)) && (((- 8u) >= (var_1_9 - var_1_6)) ? (var_1_8 == ((unsigned char) (! var_1_10))) : (var_1_8 == ((unsigned char) (((var_1_14 / var_1_12) >= var_1_14) || var_1_10))))) && (((var_1_12 * last_1_var_1_14) > var_1_13) ? ((var_1_9 < var_1_7) ? (var_1_14 == ((float) var_1_15)) : (var_1_14 == ((float) var_1_15))) : (var_1_14 == ((float) var_1_16)))) && ((((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16)))) ? (var_1_17 == ((signed long int) ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))))) : (var_1_17 == ((signed long int) last_1_var_1_6))) ; [L173] RET, EXPR property() [L173] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=128, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=1, var_1_9=-17] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=128, var_1_27=127, var_1_28=-4, var_1_29=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=1, var_1_9=-17] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 4, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 723 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 424 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 98 IncrementalHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 299 mSDtfsCounter, 98 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=3, 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, 3 MinimizatonAttempts, 31 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 720 NumberOfCodeBlocks, 720 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 941 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2772/2772 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 06:21:16,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-0.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 919b64ad06374025a27f1e638c1fbab266347de62a505876fcba854b54111d09 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:21:18,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:21:18,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:21:18,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:21:18,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:21:18,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:21:18,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:21:18,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:21:18,822 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:21:18,822 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:21:18,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:21:18,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:21:18,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:21:18,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:21:18,827 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:21:18,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:21:18,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:21:18,828 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:21:18,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:21:18,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:21:18,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:21:18,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:21:18,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:21:18,832 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:21:18,833 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:21:18,833 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:21:18,833 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:21:18,833 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:21:18,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:21:18,834 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:21:18,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:21:18,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:21:18,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:21:18,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:21:18,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:21:18,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:21:18,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:21:18,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:21:18,841 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:21:18,841 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:21:18,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:21:18,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:21:18,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:21:18,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:21:18,844 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:21:18,845 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 -> 919b64ad06374025a27f1e638c1fbab266347de62a505876fcba854b54111d09 [2024-10-24 06:21:19,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:21:19,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:21:19,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:21:19,265 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:21:19,265 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:21:19,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-0.i [2024-10-24 06:21:21,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:21:21,472 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:21:21,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-0.i [2024-10-24 06:21:21,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6161046f/3c3237c49e2d4164b33a0f1931a35c8b/FLAG1274521dd [2024-10-24 06:21:21,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6161046f/3c3237c49e2d4164b33a0f1931a35c8b [2024-10-24 06:21:21,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:21:21,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:21:21,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:21:21,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:21:21,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:21:21,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:21:21" (1/1) ... [2024-10-24 06:21:21,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28210390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:21, skipping insertion in model container [2024-10-24 06:21:21,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:21:21" (1/1) ... [2024-10-24 06:21:21,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:21:22,077 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-0.i[914,927] [2024-10-24 06:21:22,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:21:22,198 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:21:22,213 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-0.i[914,927] [2024-10-24 06:21:22,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:21:22,292 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:21:22,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:22 WrapperNode [2024-10-24 06:21:22,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:21:22,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:21:22,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:21:22,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:21:22,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:22" (1/1) ... [2024-10-24 06:21:22,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:22" (1/1) ... [2024-10-24 06:21:22,363 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-10-24 06:21:22,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:21:22,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:21:22,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:21:22,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:21:22,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:22" (1/1) ... [2024-10-24 06:21:22,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:22" (1/1) ... [2024-10-24 06:21:22,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:22" (1/1) ... [2024-10-24 06:21:22,445 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-10-24 06:21:22,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:22" (1/1) ... [2024-10-24 06:21:22,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:22" (1/1) ... [2024-10-24 06:21:22,474 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:22" (1/1) ... [2024-10-24 06:21:22,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:22" (1/1) ... [2024-10-24 06:21:22,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:22" (1/1) ... [2024-10-24 06:21:22,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:22" (1/1) ... [2024-10-24 06:21:22,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:21:22,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:21:22,500 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:21:22,500 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:21:22,501 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:22" (1/1) ... [2024-10-24 06:21:22,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:21:22,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:21:22,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:21:22,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:21:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:21:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:21:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:21:22,602 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:21:22,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:21:22,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:21:22,710 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:21:22,713 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:21:51,040 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 06:21:51,041 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:21:51,107 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:21:51,109 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:21:51,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:21:51 BoogieIcfgContainer [2024-10-24 06:21:51,110 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:21:51,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:21:51,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:21:51,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:21:51,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:21:21" (1/3) ... [2024-10-24 06:21:51,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6559e3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:21:51, skipping insertion in model container [2024-10-24 06:21:51,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:22" (2/3) ... [2024-10-24 06:21:51,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6559e3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:21:51, skipping insertion in model container [2024-10-24 06:21:51,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:21:51" (3/3) ... [2024-10-24 06:21:51,123 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-0.i [2024-10-24 06:21:51,142 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:21:51,142 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:21:51,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:21:51,228 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;@4f214948, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:21:51,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:21:51,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 06:21:51,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 06:21:51,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:51,248 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:51,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:51,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:51,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1063738640, now seen corresponding path program 1 times [2024-10-24 06:21:51,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:21:51,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573334535] [2024-10-24 06:21:51,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:51,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:21:51,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:21:51,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:21:51,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 06:21:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:53,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 06:21:53,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:21:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-10-24 06:21:53,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:21:53,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:21:53,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573334535] [2024-10-24 06:21:53,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573334535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:21:53,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:21:53,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:21:53,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949070107] [2024-10-24 06:21:53,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:21:53,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:21:53,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:21:53,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:21:53,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:21:53,901 INFO L87 Difference]: Start difference. First operand has 68 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 06:21:59,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:21:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:21:59,104 INFO L93 Difference]: Finished difference Result 133 states and 234 transitions. [2024-10-24 06:21:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:21:59,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2024-10-24 06:21:59,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:21:59,590 INFO L225 Difference]: With dead ends: 133 [2024-10-24 06:21:59,590 INFO L226 Difference]: Without dead ends: 66 [2024-10-24 06:21:59,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:21:59,597 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:21:59,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2024-10-24 06:21:59,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-24 06:21:59,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-24 06:21:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 06:21:59,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 101 transitions. [2024-10-24 06:21:59,641 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 101 transitions. Word has length 144 [2024-10-24 06:21:59,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:21:59,644 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 101 transitions. [2024-10-24 06:21:59,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 06:21:59,645 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 101 transitions. [2024-10-24 06:21:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 06:21:59,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:59,653 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:59,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 06:21:59,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:21:59,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:59,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:59,856 INFO L85 PathProgramCache]: Analyzing trace with hash -939470980, now seen corresponding path program 1 times [2024-10-24 06:21:59,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:21:59,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846797369] [2024-10-24 06:21:59,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:59,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:21:59,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:21:59,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:21:59,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 06:22:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:22:02,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 06:22:02,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:22:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 06:22:24,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:22:24,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:22:24,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846797369] [2024-10-24 06:22:24,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846797369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:22:24,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:22:24,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:22:24,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153008345] [2024-10-24 06:22:24,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:22:24,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:22:24,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:22:24,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:22:24,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:22:24,193 INFO L87 Difference]: Start difference. First operand 66 states and 101 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 06:22:30,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:22:34,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:22:38,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:22:44,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []