./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.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 b55245fdfeda07d3cc16ccf7855a16dd0888b0e85bdd23f4fc1ff2e8704085c2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:56:32,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:56:32,906 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:56:32,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:56:32,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:56:32,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:56:32,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:56:32,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:56:32,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:56:32,941 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:56:32,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:56:32,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:56:32,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:56:32,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:56:32,947 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:56:32,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:56:32,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:56:32,947 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:56:32,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:56:32,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:56:32,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:56:32,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:56:32,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:56:32,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:56:32,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:56:32,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:56:32,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:56:32,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:56:32,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:56:32,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:56:32,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:56:32,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:56:32,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:56:32,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:56:32,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:56:32,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:56:32,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:56:32,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:56:32,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:56:32,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:56:32,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:56:32,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:56:32,956 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 -> b55245fdfeda07d3cc16ccf7855a16dd0888b0e85bdd23f4fc1ff2e8704085c2 [2024-11-22 10:56:33,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:56:33,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:56:33,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:56:33,281 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:56:33,281 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:56:33,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.i [2024-11-22 10:56:34,659 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:56:34,890 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:56:34,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.i [2024-11-22 10:56:34,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9efa038f/f77f3dc457ad40fda382f6fb9f7dc906/FLAG6eb7745f2 [2024-11-22 10:56:34,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9efa038f/f77f3dc457ad40fda382f6fb9f7dc906 [2024-11-22 10:56:34,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:56:34,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:56:34,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:56:34,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:56:34,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:56:34,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:56:34" (1/1) ... [2024-11-22 10:56:34,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b5c206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:34, skipping insertion in model container [2024-11-22 10:56:34,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:56:34" (1/1) ... [2024-11-22 10:56:34,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:56:35,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.i[915,928] [2024-11-22 10:56:35,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:56:35,211 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:56:35,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.i[915,928] [2024-11-22 10:56:35,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:56:35,274 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:56:35,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:35 WrapperNode [2024-11-22 10:56:35,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:56:35,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:56:35,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:56:35,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:56:35,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:35" (1/1) ... [2024-11-22 10:56:35,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:35" (1/1) ... [2024-11-22 10:56:35,334 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-11-22 10:56:35,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:56:35,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:56:35,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:56:35,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:56:35,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:35" (1/1) ... [2024-11-22 10:56:35,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:35" (1/1) ... [2024-11-22 10:56:35,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:35" (1/1) ... [2024-11-22 10:56:35,379 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 10:56:35,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:35" (1/1) ... [2024-11-22 10:56:35,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:35" (1/1) ... [2024-11-22 10:56:35,392 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:35" (1/1) ... [2024-11-22 10:56:35,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:35" (1/1) ... [2024-11-22 10:56:35,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:35" (1/1) ... [2024-11-22 10:56:35,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:35" (1/1) ... [2024-11-22 10:56:35,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:56:35,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:56:35,408 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:56:35,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:56:35,409 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:35" (1/1) ... [2024-11-22 10:56:35,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:56:35,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:56:35,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 10:56:35,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 10:56:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:56:35,491 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:56:35,492 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:56:35,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:56:35,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:56:35,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:56:35,569 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:56:35,571 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:56:35,870 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-22 10:56:35,871 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:56:35,885 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:56:35,886 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:56:35,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:56:35 BoogieIcfgContainer [2024-11-22 10:56:35,887 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:56:35,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:56:35,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:56:35,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:56:35,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:56:34" (1/3) ... [2024-11-22 10:56:35,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f4c106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:56:35, skipping insertion in model container [2024-11-22 10:56:35,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:35" (2/3) ... [2024-11-22 10:56:35,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f4c106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:56:35, skipping insertion in model container [2024-11-22 10:56:35,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:56:35" (3/3) ... [2024-11-22 10:56:35,894 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-85.i [2024-11-22 10:56:35,909 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:56:35,910 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:56:35,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:56:35,982 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;@5ca01320, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:56:35,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:56:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 46 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 10:56:35,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-22 10:56:35,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:56:35,996 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:56:35,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:56:36,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:56:36,003 INFO L85 PathProgramCache]: Analyzing trace with hash -479375215, now seen corresponding path program 1 times [2024-11-22 10:56:36,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:56:36,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213767263] [2024-11-22 10:56:36,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:56:36,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:56:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:56:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-22 10:56:36,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:56:36,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213767263] [2024-11-22 10:56:36,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213767263] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:56:36,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002686099] [2024-11-22 10:56:36,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:56:36,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:56:36,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:56:36,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:56:36,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 10:56:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:56:36,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:56:36,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:56:36,483 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-22 10:56:36,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:56:36,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002686099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:56:36,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:56:36,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:56:36,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211773376] [2024-11-22 10:56:36,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:56:36,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:56:36,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:56:36,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:56:36,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:56:36,522 INFO L87 Difference]: Start difference. First operand has 64 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 46 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 10:56:36,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:56:36,555 INFO L93 Difference]: Finished difference Result 121 states and 202 transitions. [2024-11-22 10:56:36,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:56:36,558 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-11-22 10:56:36,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:56:36,567 INFO L225 Difference]: With dead ends: 121 [2024-11-22 10:56:36,567 INFO L226 Difference]: Without dead ends: 60 [2024-11-22 10:56:36,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:56:36,577 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:56:36,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:56:36,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-22 10:56:36,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-22 10:56:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 10:56:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-11-22 10:56:36,627 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 104 [2024-11-22 10:56:36,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:56:36,628 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-11-22 10:56:36,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 10:56:36,629 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-11-22 10:56:36,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-22 10:56:36,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:56:36,631 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:56:36,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 10:56:36,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 10:56:36,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:56:36,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:56:36,834 INFO L85 PathProgramCache]: Analyzing trace with hash 156299085, now seen corresponding path program 1 times [2024-11-22 10:56:36,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:56:36,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263802171] [2024-11-22 10:56:36,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:56:36,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:56:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:56:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 10:56:38,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:56:38,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263802171] [2024-11-22 10:56:38,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263802171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:56:38,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:56:38,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 10:56:38,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855018553] [2024-11-22 10:56:38,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:56:38,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 10:56:38,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:56:38,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 10:56:38,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:56:38,290 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 10:56:38,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:56:38,521 INFO L93 Difference]: Finished difference Result 164 states and 238 transitions. [2024-11-22 10:56:38,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 10:56:38,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-11-22 10:56:38,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:56:38,525 INFO L225 Difference]: With dead ends: 164 [2024-11-22 10:56:38,525 INFO L226 Difference]: Without dead ends: 107 [2024-11-22 10:56:38,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:56:38,527 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 58 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:56:38,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 265 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:56:38,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-22 10:56:38,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 94. [2024-11-22 10:56:38,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 68 states have internal predecessors, (86), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 10:56:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-11-22 10:56:38,553 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 104 [2024-11-22 10:56:38,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:56:38,554 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-11-22 10:56:38,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 10:56:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-11-22 10:56:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-22 10:56:38,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:56:38,559 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:56:38,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:56:38,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:56:38,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:56:38,575 INFO L85 PathProgramCache]: Analyzing trace with hash -599399218, now seen corresponding path program 1 times [2024-11-22 10:56:38,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:56:38,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145869479] [2024-11-22 10:56:38,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:56:38,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:56:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:56:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 10:56:39,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:56:39,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145869479] [2024-11-22 10:56:39,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145869479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:56:39,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:56:39,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 10:56:39,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211432426] [2024-11-22 10:56:39,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:56:39,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 10:56:39,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:56:39,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 10:56:39,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:56:39,417 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 10:56:39,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:56:39,855 INFO L93 Difference]: Finished difference Result 226 states and 307 transitions. [2024-11-22 10:56:39,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 10:56:39,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-22 10:56:39,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:56:39,858 INFO L225 Difference]: With dead ends: 226 [2024-11-22 10:56:39,858 INFO L226 Difference]: Without dead ends: 135 [2024-11-22 10:56:39,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:56:39,860 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 73 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:56:39,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 381 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:56:39,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-22 10:56:39,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2024-11-22 10:56:39,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 68 states have internal predecessors, (86), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 10:56:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-11-22 10:56:39,873 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 105 [2024-11-22 10:56:39,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:56:39,874 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-11-22 10:56:39,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 10:56:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-11-22 10:56:39,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-22 10:56:39,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:56:39,877 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:56:39,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 10:56:39,877 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:56:39,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:56:39,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1187698262, now seen corresponding path program 1 times [2024-11-22 10:56:39,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:56:39,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416752185] [2024-11-22 10:56:39,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:56:39,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:56:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:56:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 10:56:39,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:56:39,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416752185] [2024-11-22 10:56:39,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416752185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:56:39,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:56:39,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:56:39,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889493728] [2024-11-22 10:56:39,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:56:39,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:56:39,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:56:39,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:56:39,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:56:39,951 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 10:56:39,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:56:39,989 INFO L93 Difference]: Finished difference Result 192 states and 270 transitions. [2024-11-22 10:56:39,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:56:39,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-22 10:56:39,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:56:39,992 INFO L225 Difference]: With dead ends: 192 [2024-11-22 10:56:39,992 INFO L226 Difference]: Without dead ends: 101 [2024-11-22 10:56:39,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:56:39,994 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 56 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:56:39,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 182 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:56:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-22 10:56:40,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2024-11-22 10:56:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 10:56:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2024-11-22 10:56:40,014 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 105 [2024-11-22 10:56:40,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:56:40,015 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2024-11-22 10:56:40,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 10:56:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2024-11-22 10:56:40,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-22 10:56:40,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:56:40,020 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:56:40,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 10:56:40,021 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:56:40,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:56:40,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1222417992, now seen corresponding path program 1 times [2024-11-22 10:56:40,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:56:40,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515633528] [2024-11-22 10:56:40,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:56:40,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:56:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:56:40,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 10:56:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:56:40,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 10:56:40,150 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 10:56:40,151 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 10:56:40,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 10:56:40,156 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-22 10:56:40,233 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 10:56:40,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:56:40 BoogieIcfgContainer [2024-11-22 10:56:40,238 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 10:56:40,239 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 10:56:40,239 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 10:56:40,239 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 10:56:40,239 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:56:35" (3/4) ... [2024-11-22 10:56:40,242 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 10:56:40,243 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 10:56:40,244 INFO L158 Benchmark]: Toolchain (without parser) took 5327.30ms. Allocated memory was 190.8MB in the beginning and 230.7MB in the end (delta: 39.8MB). Free memory was 160.5MB in the beginning and 100.9MB in the end (delta: 59.6MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. [2024-11-22 10:56:40,244 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:56:40,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.31ms. Allocated memory is still 190.8MB. Free memory was 160.5MB in the beginning and 144.7MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 10:56:40,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.70ms. Allocated memory is still 190.8MB. Free memory was 144.7MB in the beginning and 142.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:56:40,246 INFO L158 Benchmark]: Boogie Preprocessor took 71.63ms. Allocated memory is still 190.8MB. Free memory was 142.7MB in the beginning and 140.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:56:40,247 INFO L158 Benchmark]: RCFGBuilder took 479.22ms. Allocated memory is still 190.8MB. Free memory was 140.6MB in the beginning and 148.8MB in the end (delta: -8.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-22 10:56:40,248 INFO L158 Benchmark]: TraceAbstraction took 4349.59ms. Allocated memory was 190.8MB in the beginning and 230.7MB in the end (delta: 39.8MB). Free memory was 148.8MB in the beginning and 102.0MB in the end (delta: 46.8MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. [2024-11-22 10:56:40,248 INFO L158 Benchmark]: Witness Printer took 4.67ms. Allocated memory is still 230.7MB. Free memory was 102.0MB in the beginning and 100.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:56:40,250 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.17ms. Allocated memory is still 109.1MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.31ms. Allocated memory is still 190.8MB. Free memory was 160.5MB in the beginning and 144.7MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.70ms. Allocated memory is still 190.8MB. Free memory was 144.7MB in the beginning and 142.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.63ms. Allocated memory is still 190.8MB. Free memory was 142.7MB in the beginning and 140.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 479.22ms. Allocated memory is still 190.8MB. Free memory was 140.6MB in the beginning and 148.8MB in the end (delta: -8.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4349.59ms. Allocated memory was 190.8MB in the beginning and 230.7MB in the end (delta: 39.8MB). Free memory was 148.8MB in the beginning and 102.0MB in the end (delta: 46.8MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. * Witness Printer took 4.67ms. Allocated memory is still 230.7MB. Free memory was 102.0MB in the beginning and 100.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 16; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = -64; [L25] signed long int var_1_4 = -4; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] signed char var_1_7 = 32; [L29] signed char var_1_8 = -8; [L30] signed char var_1_9 = 10; [L31] double var_1_10 = 1.6; [L32] double var_1_11 = 127.25; [L33] double var_1_12 = 2.5; VAL [isInitial=0, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=0, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L74] var_1_3 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_3 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L75] RET assume_abort_if_not(var_1_3 >= -1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L76] CALL assume_abort_if_not(var_1_3 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L76] RET assume_abort_if_not(var_1_3 <= 1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L77] var_1_4 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_4 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L78] RET assume_abort_if_not(var_1_4 >= -1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L79] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L79] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L80] var_1_5 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L81] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L82] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L82] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L83] var_1_6 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_7=32, var_1_8=-8, var_1_9=10] [L84] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_7=32, var_1_8=-8, var_1_9=10] [L85] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L85] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L86] var_1_8 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=10] [L87] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=10] [L88] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=10] [L88] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=10] [L89] var_1_9 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L90] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L91] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L91] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L92] var_1_11 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L93] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8/5, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L94] var_1_12 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L95] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L108] RET updateVariables() [L109] CALL step() [L37] signed long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=-1073741822, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L38] COND FALSE !(\read(var_1_6)) VAL [isInitial=1, stepLocal_0=-1073741822, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L43] COND TRUE \read(var_1_2) [L44] var_1_1 = (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))) VAL [isInitial=1, stepLocal_0=-1073741822, var_1_10=8/5, var_1_1=-16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L56] unsigned char stepLocal_2 = var_1_5; [L57] signed char stepLocal_1 = var_1_9; VAL [isInitial=1, stepLocal_0=-1073741822, stepLocal_1=-127, stepLocal_2=-255, var_1_10=8/5, var_1_1=-16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L58] COND TRUE ! var_1_6 [L59] var_1_10 = ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, stepLocal_0=-1073741822, stepLocal_1=-127, stepLocal_2=-255, var_1_10=132, var_1_11=132, var_1_12=132, var_1_1=-16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))))) : (var_1_5 ? (var_1_1 == ((signed long int) (var_1_7 + -4))) : (var_1_6 ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))))) && (var_1_6 ? ((var_1_3 <= var_1_4) ? (var_1_7 == ((signed char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : 1) : 1)) && ((! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1)) VAL [isInitial=1, var_1_10=132, var_1_11=132, var_1_12=132, var_1_1=-16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L100] EXPR (! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1) VAL [isInitial=1, var_1_10=132, var_1_11=132, var_1_12=132, var_1_1=-16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L100] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))))) : (var_1_5 ? (var_1_1 == ((signed long int) (var_1_7 + -4))) : (var_1_6 ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))))) && (var_1_6 ? ((var_1_3 <= var_1_4) ? (var_1_7 == ((signed char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : 1) : 1)) && ((! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1)) VAL [isInitial=1, var_1_10=132, var_1_11=132, var_1_12=132, var_1_1=-16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L100-L101] return ((var_1_2 ? (var_1_1 == ((signed long int) (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))))) : (var_1_5 ? (var_1_1 == ((signed long int) (var_1_7 + -4))) : (var_1_6 ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))))) && (var_1_6 ? ((var_1_3 <= var_1_4) ? (var_1_7 == ((signed char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : 1) : 1)) && ((! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1)) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=132, var_1_11=132, var_1_12=132, var_1_1=-16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] [L19] reach_error() VAL [isInitial=1, var_1_10=132, var_1_11=132, var_1_12=132, var_1_1=-16, var_1_2=1, var_1_3=-1073741822, var_1_4=-1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-126, var_1_9=-127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 187 mSDsluCounter, 917 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 508 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 209 IncrementalHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 409 mSDtfsCounter, 209 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=2, InterpolantAutomatonStates: 18, 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, 4 MinimizatonAttempts, 79 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 628 NumberOfCodeBlocks, 628 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 517 ConstructedInterpolants, 0 QuantifiedInterpolants, 1599 SizeOfPredicates, 0 NumberOfNonLiveVariables, 238 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 2370/2400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 10:56:40,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.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 b55245fdfeda07d3cc16ccf7855a16dd0888b0e85bdd23f4fc1ff2e8704085c2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:56:42,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:56:42,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 10:56:42,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:56:42,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:56:42,634 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:56:42,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:56:42,636 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:56:42,637 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:56:42,638 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:56:42,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:56:42,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:56:42,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:56:42,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:56:42,640 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:56:42,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:56:42,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:56:42,641 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:56:42,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:56:42,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:56:42,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:56:42,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:56:42,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:56:42,645 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 10:56:42,646 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 10:56:42,646 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:56:42,646 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 10:56:42,647 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:56:42,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:56:42,647 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:56:42,648 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:56:42,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:56:42,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:56:42,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:56:42,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:56:42,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:56:42,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:56:42,650 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:56:42,650 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 10:56:42,650 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 10:56:42,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:56:42,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:56:42,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:56:42,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:56:42,652 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 -> b55245fdfeda07d3cc16ccf7855a16dd0888b0e85bdd23f4fc1ff2e8704085c2 [2024-11-22 10:56:43,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:56:43,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:56:43,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:56:43,036 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:56:43,037 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:56:43,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.i [2024-11-22 10:56:44,681 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:56:44,891 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:56:44,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.i [2024-11-22 10:56:44,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d25ce922/3b54c41eb5924c01a484d76521e9c9c6/FLAG83221a810 [2024-11-22 10:56:44,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d25ce922/3b54c41eb5924c01a484d76521e9c9c6 [2024-11-22 10:56:44,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:56:44,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:56:44,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:56:44,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:56:44,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:56:44,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:56:44" (1/1) ... [2024-11-22 10:56:44,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c0beafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:44, skipping insertion in model container [2024-11-22 10:56:44,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:56:44" (1/1) ... [2024-11-22 10:56:44,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:56:45,147 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.i[915,928] [2024-11-22 10:56:45,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:56:45,230 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:56:45,243 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.i[915,928] [2024-11-22 10:56:45,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:56:45,308 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:56:45,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:45 WrapperNode [2024-11-22 10:56:45,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:56:45,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:56:45,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:56:45,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:56:45,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:45" (1/1) ... [2024-11-22 10:56:45,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:45" (1/1) ... [2024-11-22 10:56:45,367 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-11-22 10:56:45,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:56:45,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:56:45,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:56:45,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:56:45,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:45" (1/1) ... [2024-11-22 10:56:45,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:45" (1/1) ... [2024-11-22 10:56:45,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:45" (1/1) ... [2024-11-22 10:56:45,415 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 10:56:45,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:45" (1/1) ... [2024-11-22 10:56:45,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:45" (1/1) ... [2024-11-22 10:56:45,432 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:45" (1/1) ... [2024-11-22 10:56:45,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:45" (1/1) ... [2024-11-22 10:56:45,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:45" (1/1) ... [2024-11-22 10:56:45,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:45" (1/1) ... [2024-11-22 10:56:45,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:56:45,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:56:45,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:56:45,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:56:45,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:45" (1/1) ... [2024-11-22 10:56:45,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:56:45,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:56:45,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 10:56:45,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 10:56:45,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:56:45,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 10:56:45,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:56:45,533 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:56:45,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:56:45,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:56:45,615 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:56:45,617 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:56:45,894 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-22 10:56:45,894 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:56:45,912 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:56:45,914 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:56:45,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:56:45 BoogieIcfgContainer [2024-11-22 10:56:45,915 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:56:45,918 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:56:45,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:56:45,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:56:45,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:56:44" (1/3) ... [2024-11-22 10:56:45,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f132b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:56:45, skipping insertion in model container [2024-11-22 10:56:45,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:56:45" (2/3) ... [2024-11-22 10:56:45,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f132b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:56:45, skipping insertion in model container [2024-11-22 10:56:45,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:56:45" (3/3) ... [2024-11-22 10:56:45,927 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-85.i [2024-11-22 10:56:45,945 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:56:45,945 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:56:46,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:56:46,034 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;@76eee36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:56:46,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:56:46,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 10:56:46,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-22 10:56:46,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:56:46,053 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:56:46,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:56:46,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:56:46,061 INFO L85 PathProgramCache]: Analyzing trace with hash 759488486, now seen corresponding path program 1 times [2024-11-22 10:56:46,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:56:46,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874025207] [2024-11-22 10:56:46,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:56:46,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:56:46,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:56:46,079 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:56:46,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 10:56:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:56:46,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:56:46,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:56:46,322 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-22 10:56:46,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:56:46,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:56:46,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874025207] [2024-11-22 10:56:46,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874025207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:56:46,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:56:46,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 10:56:46,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924250116] [2024-11-22 10:56:46,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:56:46,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:56:46,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:56:46,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:56:46,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:56:46,359 INFO L87 Difference]: Start difference. First operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 10:56:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:56:46,386 INFO L93 Difference]: Finished difference Result 99 states and 168 transitions. [2024-11-22 10:56:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:56:46,388 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2024-11-22 10:56:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:56:46,394 INFO L225 Difference]: With dead ends: 99 [2024-11-22 10:56:46,395 INFO L226 Difference]: Without dead ends: 49 [2024-11-22 10:56:46,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:56:46,403 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:56:46,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:56:46,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-22 10:56:46,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-22 10:56:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 10:56:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2024-11-22 10:56:46,453 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 102 [2024-11-22 10:56:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:56:46,454 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2024-11-22 10:56:46,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 10:56:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2024-11-22 10:56:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-22 10:56:46,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:56:46,457 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:56:46,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 10:56:46,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:56:46,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:56:46,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:56:46,659 INFO L85 PathProgramCache]: Analyzing trace with hash 532217250, now seen corresponding path program 1 times [2024-11-22 10:56:46,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:56:46,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107867649] [2024-11-22 10:56:46,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:56:46,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:56:46,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:56:46,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:56:46,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 10:56:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:56:46,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 10:56:46,805 INFO L278 TraceCheckSpWp]: Computing forward predicates...