./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-50.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a6ea67ec5141ba30c704987a9668199f8d55bb535d4080241ca9c1a7de14e100 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:25:36,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:25:36,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:25:36,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:25:36,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:25:36,571 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:25:36,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:25:36,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:25:36,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:25:36,574 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:25:36,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:25:36,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:25:36,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:25:36,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:25:36,577 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:25:36,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:25:36,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:25:36,577 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:25:36,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:25:36,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:25:36,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:25:36,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:25:36,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:25:36,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:25:36,581 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:25:36,581 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:25:36,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:25:36,581 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:25:36,582 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:25:36,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:25:36,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:25:36,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:25:36,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:25:36,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:25:36,582 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:25:36,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:25:36,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:25:36,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:25:36,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:25:36,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:25:36,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:25:36,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:25:36,585 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 -> a6ea67ec5141ba30c704987a9668199f8d55bb535d4080241ca9c1a7de14e100 [2024-11-19 00:25:36,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:25:36,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:25:36,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:25:36,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:25:36,836 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:25:36,837 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-50.i [2024-11-19 00:25:38,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:25:38,477 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:25:38,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-50.i [2024-11-19 00:25:38,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad0c6916a/a93486b9cd4241949c44b5d4f3e29abb/FLAG293d4df2f [2024-11-19 00:25:38,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad0c6916a/a93486b9cd4241949c44b5d4f3e29abb [2024-11-19 00:25:38,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:25:38,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:25:38,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:25:38,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:25:38,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:25:38,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:25:38" (1/1) ... [2024-11-19 00:25:38,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b97b8d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:38, skipping insertion in model container [2024-11-19 00:25:38,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:25:38" (1/1) ... [2024-11-19 00:25:38,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:25:38,673 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-50.i[913,926] [2024-11-19 00:25:38,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:25:38,742 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:25:38,751 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-50.i[913,926] [2024-11-19 00:25:38,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:25:38,790 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:25:38,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:38 WrapperNode [2024-11-19 00:25:38,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:25:38,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:25:38,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:25:38,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:25:38,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:38" (1/1) ... [2024-11-19 00:25:38,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:38" (1/1) ... [2024-11-19 00:25:38,829 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2024-11-19 00:25:38,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:25:38,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:25:38,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:25:38,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:25:38,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:38" (1/1) ... [2024-11-19 00:25:38,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:38" (1/1) ... [2024-11-19 00:25:38,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:38" (1/1) ... [2024-11-19 00:25:38,852 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-19 00:25:38,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:38" (1/1) ... [2024-11-19 00:25:38,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:38" (1/1) ... [2024-11-19 00:25:38,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:38" (1/1) ... [2024-11-19 00:25:38,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:38" (1/1) ... [2024-11-19 00:25:38,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:38" (1/1) ... [2024-11-19 00:25:38,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:38" (1/1) ... [2024-11-19 00:25:38,869 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:25:38,872 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:25:38,872 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:25:38,872 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:25:38,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:38" (1/1) ... [2024-11-19 00:25:38,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:25:38,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:25:38,903 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-19 00:25:38,909 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-19 00:25:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:25:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:25:38,942 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:25:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:25:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:25:38,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:25:39,000 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:25:39,002 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:25:39,222 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-19 00:25:39,222 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:25:39,232 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:25:39,232 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:25:39,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:25:39 BoogieIcfgContainer [2024-11-19 00:25:39,232 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:25:39,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:25:39,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:25:39,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:25:39,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:25:38" (1/3) ... [2024-11-19 00:25:39,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee830ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:25:39, skipping insertion in model container [2024-11-19 00:25:39,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:38" (2/3) ... [2024-11-19 00:25:39,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee830ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:25:39, skipping insertion in model container [2024-11-19 00:25:39,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:25:39" (3/3) ... [2024-11-19 00:25:39,239 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-50.i [2024-11-19 00:25:39,251 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:25:39,251 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:25:39,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:25:39,298 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;@604d535e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:25:39,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:25:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 00:25:39,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-19 00:25:39,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:25:39,312 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:25:39,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:25:39,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:25:39,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1557490889, now seen corresponding path program 1 times [2024-11-19 00:25:39,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:25:39,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12123996] [2024-11-19 00:25:39,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:25:39,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:25:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:25:39,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-19 00:25:39,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:25:39,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12123996] [2024-11-19 00:25:39,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12123996] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:25:39,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562182685] [2024-11-19 00:25:39,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:25:39,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:25:39,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:25:39,600 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-19 00:25:39,604 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-19 00:25:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:25:39,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:25:39,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:25:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-19 00:25:39,827 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:25:39,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562182685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:25:39,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:25:39,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:25:39,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021846649] [2024-11-19 00:25:39,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:25:39,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:25:39,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:25:39,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:25:39,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:25:39,879 INFO L87 Difference]: Start difference. First operand has 68 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-19 00:25:39,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:25:39,903 INFO L93 Difference]: Finished difference Result 129 states and 224 transitions. [2024-11-19 00:25:39,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:25:39,904 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 159 [2024-11-19 00:25:39,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:25:39,909 INFO L225 Difference]: With dead ends: 129 [2024-11-19 00:25:39,909 INFO L226 Difference]: Without dead ends: 64 [2024-11-19 00:25:39,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 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-19 00:25:39,914 INFO L432 NwaCegarLoop]: 95 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, 95 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-19 00:25:39,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:25:39,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-19 00:25:39,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-19 00:25:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 00:25:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-11-19 00:25:39,947 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 159 [2024-11-19 00:25:39,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:25:39,948 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-11-19 00:25:39,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-19 00:25:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-11-19 00:25:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-19 00:25:39,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:25:39,951 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:25:39,965 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-19 00:25:40,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:25:40,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:25:40,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:25:40,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1240531969, now seen corresponding path program 1 times [2024-11-19 00:25:40,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:25:40,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789621577] [2024-11-19 00:25:40,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:25:40,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:25:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:25:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-19 00:25:40,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:25:40,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789621577] [2024-11-19 00:25:40,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789621577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:25:40,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:25:40,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:25:40,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275193727] [2024-11-19 00:25:40,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:25:40,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:25:40,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:25:40,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:25:40,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:25:40,414 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-19 00:25:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:25:40,556 INFO L93 Difference]: Finished difference Result 197 states and 293 transitions. [2024-11-19 00:25:40,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:25:40,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-11-19 00:25:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:25:40,560 INFO L225 Difference]: With dead ends: 197 [2024-11-19 00:25:40,560 INFO L226 Difference]: Without dead ends: 136 [2024-11-19 00:25:40,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:25:40,561 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 62 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:25:40,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 373 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:25:40,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-19 00:25:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 123. [2024-11-19 00:25:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 68 states have internal predecessors, (81), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-19 00:25:40,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 185 transitions. [2024-11-19 00:25:40,580 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 185 transitions. Word has length 159 [2024-11-19 00:25:40,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:25:40,581 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 185 transitions. [2024-11-19 00:25:40,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-19 00:25:40,581 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 185 transitions. [2024-11-19 00:25:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-19 00:25:40,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:25:40,583 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:25:40,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:25:40,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:25:40,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:25:40,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1920590339, now seen corresponding path program 1 times [2024-11-19 00:25:40,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:25:40,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257146521] [2024-11-19 00:25:40,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:25:40,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:25:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:25:40,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:25:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:25:40,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:25:40,727 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:25:40,728 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:25:40,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:25:40,732 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 00:25:40,821 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:25:40,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:25:40 BoogieIcfgContainer [2024-11-19 00:25:40,826 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:25:40,827 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:25:40,827 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:25:40,827 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:25:40,827 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:25:39" (3/4) ... [2024-11-19 00:25:40,829 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:25:40,830 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:25:40,830 INFO L158 Benchmark]: Toolchain (without parser) took 2332.38ms. Allocated memory was 148.9MB in the beginning and 234.9MB in the end (delta: 86.0MB). Free memory was 78.4MB in the beginning and 91.0MB in the end (delta: -12.6MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. [2024-11-19 00:25:40,831 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 148.9MB. Free memory is still 112.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:25:40,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.95ms. Allocated memory is still 148.9MB. Free memory was 78.0MB in the beginning and 63.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 00:25:40,831 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.60ms. Allocated memory is still 148.9MB. Free memory was 63.3MB in the beginning and 60.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:25:40,832 INFO L158 Benchmark]: Boogie Preprocessor took 38.86ms. Allocated memory is still 148.9MB. Free memory was 60.9MB in the beginning and 58.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:25:40,832 INFO L158 Benchmark]: RCFGBuilder took 360.89ms. Allocated memory was 148.9MB in the beginning and 234.9MB in the end (delta: 86.0MB). Free memory was 58.0MB in the beginning and 197.1MB in the end (delta: -139.1MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2024-11-19 00:25:40,833 INFO L158 Benchmark]: TraceAbstraction took 1592.22ms. Allocated memory is still 234.9MB. Free memory was 196.1MB in the beginning and 92.0MB in the end (delta: 104.1MB). Peak memory consumption was 102.0MB. Max. memory is 16.1GB. [2024-11-19 00:25:40,833 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 234.9MB. Free memory was 92.0MB in the beginning and 91.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:25:40,835 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.09ms. Allocated memory is still 148.9MB. Free memory is still 112.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.95ms. Allocated memory is still 148.9MB. Free memory was 78.0MB in the beginning and 63.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.60ms. Allocated memory is still 148.9MB. Free memory was 63.3MB in the beginning and 60.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.86ms. Allocated memory is still 148.9MB. Free memory was 60.9MB in the beginning and 58.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 360.89ms. Allocated memory was 148.9MB in the beginning and 234.9MB in the end (delta: 86.0MB). Free memory was 58.0MB in the beginning and 197.1MB in the end (delta: -139.1MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1592.22ms. Allocated memory is still 234.9MB. Free memory was 196.1MB in the beginning and 92.0MB in the end (delta: 104.1MB). Peak memory consumption was 102.0MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 234.9MB. Free memory was 92.0MB in the beginning and 91.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] double var_1_2 = 8.875; [L24] double var_1_3 = 63.5; [L25] double var_1_4 = 16.6; [L26] double var_1_5 = 127.8; [L27] unsigned char var_1_9 = 1; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 0; [L30] signed short int var_1_12 = -2; [L31] signed short int var_1_13 = 64; [L32] signed short int var_1_14 = 2; [L33] signed short int var_1_15 = 4; [L34] signed short int var_1_16 = 26204; [L35] signed short int var_1_17 = 5; [L36] signed long int var_1_18 = -5; [L37] signed long int var_1_19 = 100; [L38] signed long int var_1_20 = 0; [L39] signed long int var_1_21 = 128; [L40] signed long int last_1_var_1_18 = -5; VAL [isInitial=0, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=71/8, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L118] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=71/8, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L128] RET updateLastVariables() [L129] CALL updateVariables() [L75] var_1_2 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L76] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L77] var_1_3 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L78] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L79] var_1_4 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_5=639/5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_5=639/5, var_1_9=1] [L80] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_5=639/5, var_1_9=1] [L81] var_1_5 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L82] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L83] var_1_9 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128] [L84] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128] [L85] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L85] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L86] var_1_10 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L87] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L88] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L89] var_1_11 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L90] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L91] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L92] var_1_13 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_13 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L93] RET assume_abort_if_not(var_1_13 >= -32767) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_13 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L94] RET assume_abort_if_not(var_1_13 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L95] var_1_14 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_14 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L96] RET assume_abort_if_not(var_1_14 >= -32767) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L97] CALL assume_abort_if_not(var_1_14 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L97] RET assume_abort_if_not(var_1_14 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L98] var_1_15 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L99] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L100] CALL assume_abort_if_not(var_1_15 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L100] RET assume_abort_if_not(var_1_15 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L101] var_1_16 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L102] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L103] CALL assume_abort_if_not(var_1_16 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L103] RET assume_abort_if_not(var_1_16 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L104] var_1_17 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L105] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L106] CALL assume_abort_if_not(var_1_17 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L106] RET assume_abort_if_not(var_1_17 <= 16383) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L107] var_1_19 = __VERIFIER_nondet_long() [L108] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L108] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L109] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L109] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L110] var_1_20 = __VERIFIER_nondet_long() [L111] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L111] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L112] CALL assume_abort_if_not(var_1_20 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L112] RET assume_abort_if_not(var_1_20 <= 536870911) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L113] var_1_21 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_9=1] [L114] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_9=1] [L115] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_9=1] [L115] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_9=1] [L129] RET updateVariables() [L130] CALL step() [L44] signed long int stepLocal_1 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_1=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_9=1] [L45] COND FALSE !(stepLocal_1 >= 0) [L48] var_1_12 = ((((var_1_13) > ((var_1_15 - (var_1_16 - var_1_17)))) ? (var_1_13) : ((var_1_15 - (var_1_16 - var_1_17))))) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_9=1] [L50] signed long int stepLocal_3 = var_1_15 - var_1_19; [L51] signed short int stepLocal_2 = var_1_12; VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_2=4, stepLocal_3=16386, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_9=1] [L52] COND FALSE !(var_1_12 > stepLocal_3) [L57] var_1_18 = var_1_14 VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_2=4, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=32766, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_9=1] [L59] signed long int stepLocal_0 = (((var_1_12) > (var_1_18)) ? (var_1_12) : (var_1_18)); VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_0=32766, stepLocal_2=4, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=32766, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_9=1] [L60] COND FALSE !((((((var_1_2 + var_1_3)) < ((var_1_4 - var_1_5))) ? ((var_1_2 + var_1_3)) : ((var_1_4 - var_1_5)))) != 31.9) [L71] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_0=32766, stepLocal_2=4, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=32766, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=0, var_1_9=1] [L130] RET step() [L131] CALL, EXPR property() [L121-L122] return ((((((((var_1_2 + var_1_3)) < ((var_1_4 - var_1_5))) ? ((var_1_2 + var_1_3)) : ((var_1_4 - var_1_5)))) != 31.9) ? ((((((var_1_12) > (var_1_18)) ? (var_1_12) : (var_1_18))) < var_1_18) ? (var_1_9 ? (var_1_1 == ((unsigned char) var_1_10)) : (var_1_1 == ((unsigned char) var_1_10))) : (var_1_1 == ((unsigned char) var_1_10))) : (var_1_1 == ((unsigned char) var_1_11))) && ((last_1_var_1_18 >= 0) ? (var_1_12 == ((signed short int) ((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))))) : (var_1_12 == ((signed short int) ((((var_1_13) > ((var_1_15 - (var_1_16 - var_1_17)))) ? (var_1_13) : ((var_1_15 - (var_1_16 - var_1_17))))))))) && ((var_1_12 > (var_1_15 - var_1_19)) ? ((var_1_13 < var_1_12) ? (var_1_18 == ((signed long int) ((var_1_17 + (var_1_16 + var_1_20)) - var_1_21))) : 1) : (var_1_18 == ((signed long int) var_1_14))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=32766, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=0, var_1_9=1] [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=32766, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=4, var_1_14=32766, var_1_15=16386, var_1_16=32766, var_1_17=16383, var_1_18=32766, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 468 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 273 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 195 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 636 NumberOfCodeBlocks, 636 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 474 ConstructedInterpolants, 0 QuantifiedInterpolants, 658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 353 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3850/3900 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-19 00:25:40,867 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-50.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a6ea67ec5141ba30c704987a9668199f8d55bb535d4080241ca9c1a7de14e100 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:25:42,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:25:42,977 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:25:42,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:25:42,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:25:43,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:25:43,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:25:43,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:25:43,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:25:43,018 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:25:43,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:25:43,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:25:43,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:25:43,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:25:43,020 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:25:43,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:25:43,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:25:43,020 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:25:43,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:25:43,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:25:43,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:25:43,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:25:43,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:25:43,026 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:25:43,026 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:25:43,026 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:25:43,026 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:25:43,026 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:25:43,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:25:43,027 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:25:43,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:25:43,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:25:43,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:25:43,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:25:43,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:25:43,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:25:43,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:25:43,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:25:43,029 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:25:43,029 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:25:43,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:25:43,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:25:43,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:25:43,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:25:43,030 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 -> a6ea67ec5141ba30c704987a9668199f8d55bb535d4080241ca9c1a7de14e100 [2024-11-19 00:25:43,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:25:43,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:25:43,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:25:43,288 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:25:43,289 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:25:43,290 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-50.i [2024-11-19 00:25:44,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:25:44,762 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:25:44,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-50.i [2024-11-19 00:25:44,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bf9db95/096395c348d94dae9b3cfebe651ae83e/FLAG8894cfc20 [2024-11-19 00:25:44,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bf9db95/096395c348d94dae9b3cfebe651ae83e [2024-11-19 00:25:44,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:25:44,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:25:44,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:25:44,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:25:44,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:25:44,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:25:44" (1/1) ... [2024-11-19 00:25:44,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a63b78f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:44, skipping insertion in model container [2024-11-19 00:25:44,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:25:44" (1/1) ... [2024-11-19 00:25:44,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:25:44,953 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-50.i[913,926] [2024-11-19 00:25:45,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:25:45,015 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:25:45,027 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-50.i[913,926] [2024-11-19 00:25:45,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:25:45,094 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:25:45,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:45 WrapperNode [2024-11-19 00:25:45,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:25:45,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:25:45,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:25:45,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:25:45,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:45" (1/1) ... [2024-11-19 00:25:45,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:45" (1/1) ... [2024-11-19 00:25:45,134 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-11-19 00:25:45,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:25:45,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:25:45,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:25:45,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:25:45,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:45" (1/1) ... [2024-11-19 00:25:45,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:45" (1/1) ... [2024-11-19 00:25:45,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:45" (1/1) ... [2024-11-19 00:25:45,156 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-19 00:25:45,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:45" (1/1) ... [2024-11-19 00:25:45,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:45" (1/1) ... [2024-11-19 00:25:45,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:45" (1/1) ... [2024-11-19 00:25:45,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:45" (1/1) ... [2024-11-19 00:25:45,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:45" (1/1) ... [2024-11-19 00:25:45,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:45" (1/1) ... [2024-11-19 00:25:45,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:25:45,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:25:45,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:25:45,170 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:25:45,170 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:45" (1/1) ... [2024-11-19 00:25:45,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:25:45,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:25:45,206 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-19 00:25:45,211 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-19 00:25:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:25:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:25:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:25:45,247 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:25:45,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:25:45,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:25:45,308 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:25:45,310 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:25:46,800 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-19 00:25:46,800 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:25:46,812 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:25:46,812 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:25:46,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:25:46 BoogieIcfgContainer [2024-11-19 00:25:46,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:25:46,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:25:46,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:25:46,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:25:46,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:25:44" (1/3) ... [2024-11-19 00:25:46,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9c4ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:25:46, skipping insertion in model container [2024-11-19 00:25:46,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:45" (2/3) ... [2024-11-19 00:25:46,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9c4ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:25:46, skipping insertion in model container [2024-11-19 00:25:46,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:25:46" (3/3) ... [2024-11-19 00:25:46,820 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-50.i [2024-11-19 00:25:46,832 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:25:46,832 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:25:46,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:25:46,891 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;@161f06cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:25:46,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:25:46,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 00:25:46,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-19 00:25:46,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:25:46,931 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:25:46,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:25:46,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:25:46,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1557490889, now seen corresponding path program 1 times [2024-11-19 00:25:46,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:25:46,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137989168] [2024-11-19 00:25:46,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:25:46,951 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-19 00:25:46,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:25:46,958 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-19 00:25:46,959 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-19 00:25:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:25:47,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:25:47,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:25:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 986 trivial. 0 not checked. [2024-11-19 00:25:47,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:25:47,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:25:47,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137989168] [2024-11-19 00:25:47,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137989168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:25:47,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:25:47,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:25:47,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20812476] [2024-11-19 00:25:47,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:25:47,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:25:47,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:25:47,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:25:47,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:25:47,318 INFO L87 Difference]: Start difference. First operand has 68 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-19 00:25:47,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:25:47,340 INFO L93 Difference]: Finished difference Result 129 states and 224 transitions. [2024-11-19 00:25:47,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:25:47,341 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 159 [2024-11-19 00:25:47,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:25:47,347 INFO L225 Difference]: With dead ends: 129 [2024-11-19 00:25:47,347 INFO L226 Difference]: Without dead ends: 64 [2024-11-19 00:25:47,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 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-19 00:25:47,352 INFO L432 NwaCegarLoop]: 95 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, 95 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-19 00:25:47,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:25:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-19 00:25:47,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-19 00:25:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 00:25:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-11-19 00:25:47,393 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 159 [2024-11-19 00:25:47,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:25:47,395 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-11-19 00:25:47,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-19 00:25:47,395 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-11-19 00:25:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-19 00:25:47,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:25:47,400 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:25:47,410 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-19 00:25:47,604 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-19 00:25:47,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:25:47,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:25:47,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1240531969, now seen corresponding path program 1 times [2024-11-19 00:25:47,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:25:47,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537860931] [2024-11-19 00:25:47,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:25:47,609 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-19 00:25:47,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:25:47,612 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-19 00:25:47,614 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-19 00:25:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:25:47,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:25:47,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:25:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-19 00:25:48,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:25:48,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:25:48,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537860931] [2024-11-19 00:25:48,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537860931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:25:48,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:25:48,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:25:48,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234497297] [2024-11-19 00:25:48,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:25:48,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:25:48,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:25:48,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:25:48,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:25:48,404 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-19 00:25:50,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:25:50,577 INFO L93 Difference]: Finished difference Result 197 states and 293 transitions. [2024-11-19 00:25:50,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:25:50,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-11-19 00:25:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:25:50,595 INFO L225 Difference]: With dead ends: 197 [2024-11-19 00:25:50,595 INFO L226 Difference]: Without dead ends: 136 [2024-11-19 00:25:50,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:25:50,596 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 59 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:25:50,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 373 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 00:25:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-19 00:25:50,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 123. [2024-11-19 00:25:50,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 68 states have internal predecessors, (81), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-19 00:25:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 185 transitions. [2024-11-19 00:25:50,616 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 185 transitions. Word has length 159 [2024-11-19 00:25:50,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:25:50,617 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 185 transitions. [2024-11-19 00:25:50,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-19 00:25:50,617 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 185 transitions. [2024-11-19 00:25:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-19 00:25:50,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:25:50,619 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:25:50,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 00:25:50,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:25:50,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:25:50,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:25:50,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1920590339, now seen corresponding path program 1 times [2024-11-19 00:25:50,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:25:50,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779378579] [2024-11-19 00:25:50,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:25:50,821 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-19 00:25:50,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:25:50,824 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:25:50,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 00:25:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:25:51,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 00:25:51,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:26:12,752 WARN L286 SmtUtils]: Spent 7.40s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)