./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-40.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4489e800ee4794c55791b1f834830bc313f49297425e5ef7d1ffd16c6d31677a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:01:17,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:01:17,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:01:17,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:01:17,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:01:17,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:01:17,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:01:17,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:01:17,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:01:17,210 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:01:17,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:01:17,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:01:17,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:01:17,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:01:17,212 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:01:17,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:01:17,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:01:17,212 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:01:17,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:01:17,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:01:17,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:01:17,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:01:17,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:01:17,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:01:17,219 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:01:17,219 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:01:17,219 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:01:17,219 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:01:17,219 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:01:17,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:01:17,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:01:17,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:01:17,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:01:17,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:01:17,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:01:17,220 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:01:17,220 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:01:17,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:01:17,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:01:17,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:01:17,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:01:17,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:01:17,222 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 -> 4489e800ee4794c55791b1f834830bc313f49297425e5ef7d1ffd16c6d31677a [2024-11-16 18:01:17,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:01:17,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:01:17,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:01:17,429 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:01:17,430 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:01:17,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-40.i [2024-11-16 18:01:18,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:01:18,802 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:01:18,803 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-40.i [2024-11-16 18:01:18,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f586f2bf3/f2ebc1f7011e4ee8ab01dc79e4bb1c2d/FLAGbff2d29a0 [2024-11-16 18:01:19,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f586f2bf3/f2ebc1f7011e4ee8ab01dc79e4bb1c2d [2024-11-16 18:01:19,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:01:19,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:01:19,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:01:19,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:01:19,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:01:19,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:01:19" (1/1) ... [2024-11-16 18:01:19,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a979e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:19, skipping insertion in model container [2024-11-16 18:01:19,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:01:19" (1/1) ... [2024-11-16 18:01:19,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:01:19,360 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_variablewrapping_normal_file-40.i[913,926] [2024-11-16 18:01:19,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:01:19,394 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:01:19,403 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_variablewrapping_normal_file-40.i[913,926] [2024-11-16 18:01:19,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:01:19,443 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:01:19,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:19 WrapperNode [2024-11-16 18:01:19,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:01:19,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:01:19,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:01:19,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:01:19,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:19" (1/1) ... [2024-11-16 18:01:19,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:19" (1/1) ... [2024-11-16 18:01:19,493 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-11-16 18:01:19,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:01:19,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:01:19,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:01:19,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:01:19,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:19" (1/1) ... [2024-11-16 18:01:19,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:19" (1/1) ... [2024-11-16 18:01:19,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:19" (1/1) ... [2024-11-16 18:01:19,515 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-16 18:01:19,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:19" (1/1) ... [2024-11-16 18:01:19,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:19" (1/1) ... [2024-11-16 18:01:19,519 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:19" (1/1) ... [2024-11-16 18:01:19,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:19" (1/1) ... [2024-11-16 18:01:19,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:19" (1/1) ... [2024-11-16 18:01:19,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:19" (1/1) ... [2024-11-16 18:01:19,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:01:19,529 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:01:19,529 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:01:19,529 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:01:19,530 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:19" (1/1) ... [2024-11-16 18:01:19,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:01:19,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:01:19,564 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-16 18:01:19,566 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-16 18:01:19,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:01:19,601 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:01:19,601 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:01:19,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 18:01:19,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:01:19,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:01:19,676 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:01:19,678 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:01:19,874 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc property_#t~bitwise14#1;havoc property_#t~short15#1; [2024-11-16 18:01:19,897 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 18:01:19,897 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:01:19,916 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:01:19,916 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:01:19,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:01:19 BoogieIcfgContainer [2024-11-16 18:01:19,917 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:01:19,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:01:19,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:01:19,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:01:19,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:01:19" (1/3) ... [2024-11-16 18:01:19,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b369c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:01:19, skipping insertion in model container [2024-11-16 18:01:19,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:19" (2/3) ... [2024-11-16 18:01:19,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b369c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:01:19, skipping insertion in model container [2024-11-16 18:01:19,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:01:19" (3/3) ... [2024-11-16 18:01:19,926 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-40.i [2024-11-16 18:01:19,940 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:01:19,941 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:01:19,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:01:19,993 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;@532a0a49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:01:19,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:01:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-16 18:01:20,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:01:20,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:01:20,006 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:01:20,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:01:20,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:01:20,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1754806862, now seen corresponding path program 1 times [2024-11-16 18:01:20,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:01:20,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647007721] [2024-11-16 18:01:20,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:01:20,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:01:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:01:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 18:01:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 18:01:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 18:01:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 18:01:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:01:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 18:01:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 18:01:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 18:01:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:01:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:01:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 18:01:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 18:01:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 18:01:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 18:01:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 18:01:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:01:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 18:01:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 18:01:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,308 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-16 18:01:20,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:01:20,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647007721] [2024-11-16 18:01:20,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647007721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:01:20,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:01:20,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:01:20,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883080924] [2024-11-16 18:01:20,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:01:20,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:01:20,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:01:20,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:01:20,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:01:20,353 INFO L87 Difference]: Start difference. First operand has 67 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-16 18:01:20,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:01:20,395 INFO L93 Difference]: Finished difference Result 126 states and 212 transitions. [2024-11-16 18:01:20,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:01:20,419 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 123 [2024-11-16 18:01:20,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:01:20,432 INFO L225 Difference]: With dead ends: 126 [2024-11-16 18:01:20,432 INFO L226 Difference]: Without dead ends: 62 [2024-11-16 18:01:20,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-16 18:01:20,440 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:01:20,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:01:20,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-16 18:01:20,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-16 18:01:20,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-16 18:01:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 92 transitions. [2024-11-16 18:01:20,477 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 92 transitions. Word has length 123 [2024-11-16 18:01:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:01:20,478 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 92 transitions. [2024-11-16 18:01:20,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-16 18:01:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 92 transitions. [2024-11-16 18:01:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:01:20,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:01:20,483 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:01:20,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:01:20,483 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:01:20,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:01:20,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2125319477, now seen corresponding path program 1 times [2024-11-16 18:01:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:01:20,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193250949] [2024-11-16 18:01:20,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:01:20,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:01:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:01:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 18:01:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 18:01:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 18:01:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 18:01:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:01:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 18:01:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 18:01:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 18:01:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:01:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:01:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 18:01:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 18:01:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 18:01:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 18:01:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 18:01:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 18:01:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 18:01:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 18:01:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-16 18:01:20,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:01:20,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193250949] [2024-11-16 18:01:20,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193250949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:01:20,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:01:20,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:01:20,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587671962] [2024-11-16 18:01:20,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:01:20,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:01:20,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:01:20,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:01:20,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:01:20,957 INFO L87 Difference]: Start difference. First operand 62 states and 92 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-16 18:01:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:01:21,034 INFO L93 Difference]: Finished difference Result 142 states and 209 transitions. [2024-11-16 18:01:21,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:01:21,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 123 [2024-11-16 18:01:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:01:21,036 INFO L225 Difference]: With dead ends: 142 [2024-11-16 18:01:21,036 INFO L226 Difference]: Without dead ends: 83 [2024-11-16 18:01:21,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:01:21,038 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 25 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:01:21,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 444 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:01:21,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-16 18:01:21,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2024-11-16 18:01:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-16 18:01:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2024-11-16 18:01:21,049 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 123 [2024-11-16 18:01:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:01:21,050 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2024-11-16 18:01:21,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-16 18:01:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2024-11-16 18:01:21,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 18:01:21,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:01:21,056 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:01:21,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:01:21,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:01:21,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:01:21,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1922554742, now seen corresponding path program 1 times [2024-11-16 18:01:21,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:01:21,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700683360] [2024-11-16 18:01:21,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:01:21,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:01:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 18:01:21,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619005969] [2024-11-16 18:01:21,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:01:21,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:01:21,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:01:21,122 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-16 18:01:21,123 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-16 18:01:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:01:21,216 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:01:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:01:21,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:01:21,315 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:01:21,316 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:01:21,330 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-16 18:01:21,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:01:21,525 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 18:01:21,599 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:01:21,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:01:21 BoogieIcfgContainer [2024-11-16 18:01:21,601 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:01:21,602 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:01:21,602 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:01:21,602 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:01:21,602 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:01:19" (3/4) ... [2024-11-16 18:01:21,604 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:01:21,605 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:01:21,605 INFO L158 Benchmark]: Toolchain (without parser) took 2406.01ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 101.7MB in the beginning and 67.5MB in the end (delta: 34.2MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2024-11-16 18:01:21,606 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:01:21,606 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.02ms. Allocated memory is still 176.2MB. Free memory was 101.7MB in the beginning and 143.7MB in the end (delta: -42.0MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-11-16 18:01:21,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.76ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 143.7MB in the beginning and 199.6MB in the end (delta: -55.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 18:01:21,607 INFO L158 Benchmark]: Boogie Preprocessor took 33.85ms. Allocated memory is still 228.6MB. Free memory was 199.6MB in the beginning and 197.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:01:21,607 INFO L158 Benchmark]: IcfgBuilder took 388.22ms. Allocated memory is still 228.6MB. Free memory was 197.5MB in the beginning and 176.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 18:01:21,607 INFO L158 Benchmark]: TraceAbstraction took 1681.60ms. Allocated memory is still 228.6MB. Free memory was 175.4MB in the beginning and 67.5MB in the end (delta: 108.0MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. [2024-11-16 18:01:21,607 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 228.6MB. Free memory is still 67.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:01:21,609 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.15ms. Allocated memory is still 176.2MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.02ms. Allocated memory is still 176.2MB. Free memory was 101.7MB in the beginning and 143.7MB in the end (delta: -42.0MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.76ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 143.7MB in the beginning and 199.6MB in the end (delta: -55.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.85ms. Allocated memory is still 228.6MB. Free memory was 199.6MB in the beginning and 197.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 388.22ms. Allocated memory is still 228.6MB. Free memory was 197.5MB in the beginning and 176.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1681.60ms. Allocated memory is still 228.6MB. Free memory was 175.4MB in the beginning and 67.5MB in the end (delta: 108.0MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 228.6MB. Free memory is still 67.5MB. 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, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryArithmeticDOUBLEoperation at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_7 = 64; [L26] signed long int var_1_8 = -2; [L27] signed long int var_1_9 = -10; [L28] unsigned char var_1_11 = 128; [L29] unsigned char var_1_12 = 1; [L30] double var_1_13 = 8.4; [L31] double var_1_15 = 49.75; [L32] signed char var_1_16 = -2; [L33] signed char var_1_17 = 25; [L34] signed char var_1_18 = -5; [L35] float var_1_19 = 7.5; [L36] signed short int var_1_20 = 1; [L37] signed short int var_1_21 = -256; [L38] double last_1_var_1_13 = 8.4; VAL [isInitial=0, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=0, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L97] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=0, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L70] var_1_3 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L72] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L72] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L73] var_1_8 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L74] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L75] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L75] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L76] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L76] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L77] var_1_9 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L78] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L79] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L79] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L80] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L80] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L81] var_1_11 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_11 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L82] RET assume_abort_if_not(var_1_11 >= 127) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L83] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L83] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L84] var_1_12 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L85] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L86] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L86] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L87] var_1_15 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L88] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L89] var_1_17 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L90] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L91] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L91] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L92] var_1_18 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=0, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=0, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L93] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=0, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L94] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=0, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=0, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L94] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=0, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L108] RET updateVariables() [L109] CALL step() [L42] COND TRUE \read(var_1_3) [L43] var_1_16 = ((((var_1_17) > ((-2 + var_1_18))) ? (var_1_17) : ((-2 + var_1_18)))) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L45] var_1_19 = var_1_15 [L46] var_1_20 = var_1_16 [L47] var_1_21 = var_1_18 VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=0, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L48] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=0, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L49] COND FALSE !(var_1_3 && (var_1_19 <= (- 63.9f))) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=0, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L57] EXPR var_1_21 | var_1_16 VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=0, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L57] COND TRUE ((var_1_16 / var_1_8) / var_1_9) >= (var_1_21 | var_1_16) [L58] var_1_7 = (var_1_11 - var_1_12) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=0, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=2] [L62] COND TRUE var_1_19 != ((((last_1_var_1_13) < (var_1_19)) ? (last_1_var_1_13) : (var_1_19))) [L63] var_1_13 = (var_1_15 + (127.4 - 8.25)) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=0, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=2] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (var_1_2 ? ((var_1_3 && (var_1_19 <= (- 63.9f))) ? ((var_1_19 >= var_1_19) ? (var_1_3 ? (var_1_1 == ((signed long int) var_1_21)) : 1) : 1) : 1) : 1) && ((((var_1_16 / var_1_8) / var_1_9) >= (var_1_21 | var_1_16)) ? (var_1_7 == ((unsigned char) (var_1_11 - var_1_12))) : (var_1_7 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=0, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=2] [L100-L101] return ((((((var_1_2 ? ((var_1_3 && (var_1_19 <= (- 63.9f))) ? ((var_1_19 >= var_1_19) ? (var_1_3 ? (var_1_1 == ((signed long int) var_1_21)) : 1) : 1) : 1) : 1) && ((((var_1_16 / var_1_8) / var_1_9) >= (var_1_21 | var_1_16)) ? (var_1_7 == ((unsigned char) (var_1_11 - var_1_12))) : (var_1_7 == ((unsigned char) var_1_12)))) && ((var_1_19 != ((((last_1_var_1_13) < (var_1_19)) ? (last_1_var_1_13) : (var_1_19)))) ? (var_1_13 == ((double) (var_1_15 + (127.4 - 8.25)))) : 1)) && (var_1_3 ? (var_1_16 == ((signed char) ((((var_1_17) > ((-2 + var_1_18))) ? (var_1_17) : ((-2 + var_1_18)))))) : 1)) && (var_1_19 == ((float) var_1_15))) && (var_1_20 == ((signed short int) var_1_16))) && (var_1_21 == ((signed short int) var_1_18)) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=0, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=0, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 534 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 349 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 185 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 14 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 494 NumberOfCodeBlocks, 494 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1368/1368 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-16 18:01:21,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-40.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4489e800ee4794c55791b1f834830bc313f49297425e5ef7d1ffd16c6d31677a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:01:23,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:01:23,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:01:23,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:01:23,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:01:23,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:01:23,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:01:23,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:01:23,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:01:23,595 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:01:23,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:01:23,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:01:23,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:01:23,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:01:23,596 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:01:23,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:01:23,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:01:23,598 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:01:23,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:01:23,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:01:23,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:01:23,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:01:23,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:01:23,599 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:01:23,603 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:01:23,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:01:23,603 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:01:23,604 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:01:23,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:01:23,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:01:23,604 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:01:23,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:01:23,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:01:23,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:01:23,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:01:23,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:01:23,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:01:23,605 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:01:23,605 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:01:23,606 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:01:23,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:01:23,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:01:23,606 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:01:23,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:01:23,606 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 -> 4489e800ee4794c55791b1f834830bc313f49297425e5ef7d1ffd16c6d31677a [2024-11-16 18:01:23,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:01:23,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:01:23,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:01:23,881 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:01:23,881 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:01:23,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-40.i [2024-11-16 18:01:25,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:01:25,282 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:01:25,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-40.i [2024-11-16 18:01:25,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc9054f5/62973c7df4f849a6b66042fa321085d0/FLAG7b1b4dc04 [2024-11-16 18:01:25,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc9054f5/62973c7df4f849a6b66042fa321085d0 [2024-11-16 18:01:25,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:01:25,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:01:25,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:01:25,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:01:25,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:01:25,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:01:25" (1/1) ... [2024-11-16 18:01:25,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5805e43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:25, skipping insertion in model container [2024-11-16 18:01:25,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:01:25" (1/1) ... [2024-11-16 18:01:25,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:01:25,471 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_variablewrapping_normal_file-40.i[913,926] [2024-11-16 18:01:25,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:01:25,527 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:01:25,536 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_variablewrapping_normal_file-40.i[913,926] [2024-11-16 18:01:25,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:01:25,583 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:01:25,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:25 WrapperNode [2024-11-16 18:01:25,583 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:01:25,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:01:25,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:01:25,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:01:25,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:25" (1/1) ... [2024-11-16 18:01:25,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:25" (1/1) ... [2024-11-16 18:01:25,626 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-11-16 18:01:25,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:01:25,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:01:25,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:01:25,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:01:25,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:25" (1/1) ... [2024-11-16 18:01:25,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:25" (1/1) ... [2024-11-16 18:01:25,641 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:25" (1/1) ... [2024-11-16 18:01:25,656 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-16 18:01:25,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:25" (1/1) ... [2024-11-16 18:01:25,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:25" (1/1) ... [2024-11-16 18:01:25,667 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:25" (1/1) ... [2024-11-16 18:01:25,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:25" (1/1) ... [2024-11-16 18:01:25,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:25" (1/1) ... [2024-11-16 18:01:25,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:25" (1/1) ... [2024-11-16 18:01:25,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:01:25,676 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:01:25,676 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:01:25,676 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:01:25,677 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:25" (1/1) ... [2024-11-16 18:01:25,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:01:25,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:01:25,709 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-16 18:01:25,720 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-16 18:01:25,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:01:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:01:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:01:25,757 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:01:25,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:01:25,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:01:25,834 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:01:25,837 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:01:28,255 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 18:01:28,256 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:01:28,267 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:01:28,268 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:01:28,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:01:28 BoogieIcfgContainer [2024-11-16 18:01:28,268 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:01:28,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:01:28,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:01:28,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:01:28,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:01:25" (1/3) ... [2024-11-16 18:01:28,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430be8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:01:28, skipping insertion in model container [2024-11-16 18:01:28,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:25" (2/3) ... [2024-11-16 18:01:28,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430be8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:01:28, skipping insertion in model container [2024-11-16 18:01:28,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:01:28" (3/3) ... [2024-11-16 18:01:28,278 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-40.i [2024-11-16 18:01:28,292 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:01:28,292 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:01:28,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:01:28,338 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;@14086b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:01:28,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:01:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-16 18:01:28,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 18:01:28,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:01:28,352 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:01:28,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:01:28,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:01:28,357 INFO L85 PathProgramCache]: Analyzing trace with hash -70858500, now seen corresponding path program 1 times [2024-11-16 18:01:28,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:01:28,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326190099] [2024-11-16 18:01:28,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:01:28,370 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-16 18:01:28,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:01:28,373 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-16 18:01:28,374 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-16 18:01:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:28,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 18:01:28,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:01:28,741 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-16 18:01:28,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:01:28,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:01:28,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326190099] [2024-11-16 18:01:28,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326190099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:01:28,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:01:28,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:01:28,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974401929] [2024-11-16 18:01:28,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:01:28,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:01:28,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:01:28,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:01:28,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:01:28,769 INFO L87 Difference]: Start difference. First operand has 58 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-16 18:01:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:01:28,795 INFO L93 Difference]: Finished difference Result 108 states and 184 transitions. [2024-11-16 18:01:28,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:01:28,797 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 120 [2024-11-16 18:01:28,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:01:28,802 INFO L225 Difference]: With dead ends: 108 [2024-11-16 18:01:28,802 INFO L226 Difference]: Without dead ends: 53 [2024-11-16 18:01:28,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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-16 18:01:28,808 INFO L432 NwaCegarLoop]: 78 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, 78 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-16 18:01:28,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:01:28,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-16 18:01:28,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-16 18:01:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-16 18:01:28,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 78 transitions. [2024-11-16 18:01:28,838 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 78 transitions. Word has length 120 [2024-11-16 18:01:28,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:01:28,838 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 78 transitions. [2024-11-16 18:01:28,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-16 18:01:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 78 transitions. [2024-11-16 18:01:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 18:01:28,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:01:28,842 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:01:28,855 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-16 18:01:29,043 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-16 18:01:29,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:01:29,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:01:29,044 INFO L85 PathProgramCache]: Analyzing trace with hash 455780441, now seen corresponding path program 1 times [2024-11-16 18:01:29,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:01:29,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922304675] [2024-11-16 18:01:29,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:01:29,045 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-16 18:01:29,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:01:29,046 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-16 18:01:29,047 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-16 18:01:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:29,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 18:01:29,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:02:30,429 WARN L286 SmtUtils]: Spent 13.82s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)