./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.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 5f7089906045f68da9fc900e2f38b68a58c1b0c4f2e88e8e487f0f744e1e424c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:27:17,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:27:17,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:27:17,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:27:17,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:27:17,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:27:17,650 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:27:17,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:27:17,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:27:17,653 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:27:17,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:27:17,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:27:17,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:27:17,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:27:17,655 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:27:17,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:27:17,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:27:17,657 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:27:17,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:27:17,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:27:17,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:27:17,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:27:17,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:27:17,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:27:17,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:27:17,661 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:27:17,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:27:17,661 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:27:17,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:27:17,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:27:17,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:27:17,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:27:17,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:27:17,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:27:17,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:27:17,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:27:17,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:27:17,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:27:17,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:27:17,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:27:17,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:27:17,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:27:17,666 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 -> 5f7089906045f68da9fc900e2f38b68a58c1b0c4f2e88e8e487f0f744e1e424c [2024-10-24 05:27:17,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:27:17,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:27:17,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:27:17,953 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:27:17,953 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:27:17,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.i [2024-10-24 05:27:19,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:27:19,645 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:27:19,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.i [2024-10-24 05:27:19,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce798027/94a0724354d4416894303a41e77a4a39/FLAGcc8636017 [2024-10-24 05:27:19,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce798027/94a0724354d4416894303a41e77a4a39 [2024-10-24 05:27:19,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:27:19,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:27:19,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:27:19,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:27:19,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:27:19,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:27:19" (1/1) ... [2024-10-24 05:27:19,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b79fbb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:19, skipping insertion in model container [2024-10-24 05:27:19,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:27:19" (1/1) ... [2024-10-24 05:27:19,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:27:19,878 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.i[913,926] [2024-10-24 05:27:19,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:27:19,981 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:27:19,990 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.i[913,926] [2024-10-24 05:27:20,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:27:20,036 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:27:20,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20 WrapperNode [2024-10-24 05:27:20,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:27:20,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:27:20,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:27:20,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:27:20,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,102 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2024-10-24 05:27:20,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:27:20,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:27:20,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:27:20,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:27:20,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,126 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,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-10-24 05:27:20,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,172 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:27:20,191 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:27:20,191 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:27:20,191 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:27:20,192 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (1/1) ... [2024-10-24 05:27:20,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:27:20,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:27:20,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:27:20,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:27:20,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:27:20,296 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:27:20,297 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:27:20,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:27:20,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:27:20,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:27:20,393 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:27:20,397 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:27:20,860 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 05:27:20,861 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:27:20,899 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:27:20,900 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:27:20,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:27:20 BoogieIcfgContainer [2024-10-24 05:27:20,901 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:27:20,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:27:20,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:27:20,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:27:20,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:27:19" (1/3) ... [2024-10-24 05:27:20,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcb4216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:27:20, skipping insertion in model container [2024-10-24 05:27:20,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:20" (2/3) ... [2024-10-24 05:27:20,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcb4216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:27:20, skipping insertion in model container [2024-10-24 05:27:20,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:27:20" (3/3) ... [2024-10-24 05:27:20,911 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-97.i [2024-10-24 05:27:20,929 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:27:20,930 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:27:21,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:27:21,013 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;@389ab440, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:27:21,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:27:21,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 05:27:21,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 05:27:21,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:27:21,034 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:27:21,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:27:21,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:27:21,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2003385614, now seen corresponding path program 1 times [2024-10-24 05:27:21,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:27:21,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954285354] [2024-10-24 05:27:21,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:27:21,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:27:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:27:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:27:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:27:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:27:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:27:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:27:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:27:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:27:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:27:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:27:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:27:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:27:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 05:27:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:27:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:27:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:27:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:27:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:27:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:27:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:27:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 05:27:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 05:27:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 05:27:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 05:27:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 05:27:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:27:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:27:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:27:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 05:27:21,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:27:21,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954285354] [2024-10-24 05:27:21,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954285354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:27:21,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:27:21,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:27:21,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673086712] [2024-10-24 05:27:21,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:27:21,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:27:21,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:27:21,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:27:21,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:27:21,541 INFO L87 Difference]: Start difference. First operand has 91 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 05:27:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:27:21,625 INFO L93 Difference]: Finished difference Result 177 states and 310 transitions. [2024-10-24 05:27:21,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:27:21,631 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 170 [2024-10-24 05:27:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:27:21,647 INFO L225 Difference]: With dead ends: 177 [2024-10-24 05:27:21,647 INFO L226 Difference]: Without dead ends: 87 [2024-10-24 05:27:21,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:27:21,686 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:27:21,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:27:21,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-24 05:27:21,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-24 05:27:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 05:27:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 132 transitions. [2024-10-24 05:27:21,744 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 132 transitions. Word has length 170 [2024-10-24 05:27:21,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:27:21,745 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 132 transitions. [2024-10-24 05:27:21,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 05:27:21,745 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 132 transitions. [2024-10-24 05:27:21,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 05:27:21,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:27:21,749 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:27:21,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:27:21,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:27:21,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:27:21,751 INFO L85 PathProgramCache]: Analyzing trace with hash -735295818, now seen corresponding path program 1 times [2024-10-24 05:27:21,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:27:21,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921091267] [2024-10-24 05:27:21,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:27:21,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:27:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:27:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:27:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:27:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:27:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:27:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:27:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:27:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:27:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:27:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:27:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:27:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:27:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 05:27:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:27:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:27:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:27:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:27:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:27:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:27:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:27:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 05:27:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 05:27:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 05:27:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 05:27:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 05:27:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:27:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:27:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:27:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 05:27:22,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:27:22,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921091267] [2024-10-24 05:27:22,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921091267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:27:22,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:27:22,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:27:22,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479889958] [2024-10-24 05:27:22,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:27:22,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:27:22,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:27:22,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:27:22,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:27:22,494 INFO L87 Difference]: Start difference. First operand 87 states and 132 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 05:27:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:27:22,583 INFO L93 Difference]: Finished difference Result 174 states and 264 transitions. [2024-10-24 05:27:22,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:27:22,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2024-10-24 05:27:22,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:27:22,590 INFO L225 Difference]: With dead ends: 174 [2024-10-24 05:27:22,590 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 05:27:22,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:27:22,592 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:27:22,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 308 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:27:22,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 05:27:22,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-10-24 05:27:22,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 05:27:22,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 131 transitions. [2024-10-24 05:27:22,607 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 131 transitions. Word has length 170 [2024-10-24 05:27:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:27:22,611 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 131 transitions. [2024-10-24 05:27:22,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 05:27:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 131 transitions. [2024-10-24 05:27:22,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-24 05:27:22,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:27:22,617 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:27:22,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:27:22,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:27:22,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:27:22,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1261565093, now seen corresponding path program 1 times [2024-10-24 05:27:22,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:27:22,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825064164] [2024-10-24 05:27:22,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:27:22,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:27:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:27:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:27:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:27:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:27:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:27:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:27:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:27:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:27:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:27:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:27:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:27:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:27:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 05:27:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:27:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:27:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:27:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:27:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:27:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:27:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:27:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 05:27:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 05:27:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 05:27:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 05:27:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 05:27:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:27:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:27:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:27:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 05:27:26,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:27:26,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825064164] [2024-10-24 05:27:26,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825064164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:27:26,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:27:26,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 05:27:26,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196119067] [2024-10-24 05:27:26,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:27:26,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 05:27:26,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:27:26,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 05:27:26,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:27:26,525 INFO L87 Difference]: Start difference. First operand 87 states and 131 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 05:27:27,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:27:27,776 INFO L93 Difference]: Finished difference Result 269 states and 394 transitions. [2024-10-24 05:27:27,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 05:27:27,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2024-10-24 05:27:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:27:27,779 INFO L225 Difference]: With dead ends: 269 [2024-10-24 05:27:27,780 INFO L226 Difference]: Without dead ends: 183 [2024-10-24 05:27:27,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-24 05:27:27,782 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 219 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 05:27:27,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 552 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 05:27:27,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-24 05:27:27,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 102. [2024-10-24 05:27:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 72 states have internal predecessors, (97), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 05:27:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 153 transitions. [2024-10-24 05:27:27,796 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 153 transitions. Word has length 172 [2024-10-24 05:27:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:27:27,797 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 153 transitions. [2024-10-24 05:27:27,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 05:27:27,798 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 153 transitions. [2024-10-24 05:27:27,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-24 05:27:27,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:27:27,801 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:27:27,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:27:27,801 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:27:27,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:27:27,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1003399655, now seen corresponding path program 1 times [2024-10-24 05:27:27,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:27:27,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896040231] [2024-10-24 05:27:27,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:27:27,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:27:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:27:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:27:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:27:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:27:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:27:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:27:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:27:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:27:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:27:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:27:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:27:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:27:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 05:27:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:27:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:27:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:27:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:27:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:27:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:27:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:27:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 05:27:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 05:27:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 05:27:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 05:27:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 05:27:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:27:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:27:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:27:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 05:27:29,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:27:29,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896040231] [2024-10-24 05:27:29,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896040231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:27:29,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:27:29,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 05:27:29,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192052010] [2024-10-24 05:27:29,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:27:29,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 05:27:29,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:27:29,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 05:27:29,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:27:29,917 INFO L87 Difference]: Start difference. First operand 102 states and 153 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 05:27:30,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:27:30,951 INFO L93 Difference]: Finished difference Result 267 states and 393 transitions. [2024-10-24 05:27:30,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 05:27:30,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2024-10-24 05:27:30,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:27:30,956 INFO L225 Difference]: With dead ends: 267 [2024-10-24 05:27:30,956 INFO L226 Difference]: Without dead ends: 166 [2024-10-24 05:27:30,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-24 05:27:30,962 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 121 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 05:27:30,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 597 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 05:27:30,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-24 05:27:30,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 111. [2024-10-24 05:27:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 05:27:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 167 transitions. [2024-10-24 05:27:30,986 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 167 transitions. Word has length 172 [2024-10-24 05:27:30,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:27:30,988 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 167 transitions. [2024-10-24 05:27:30,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 05:27:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 167 transitions. [2024-10-24 05:27:30,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-24 05:27:30,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:27:30,990 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:27:30,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 05:27:30,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:27:30,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:27:30,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1848371107, now seen corresponding path program 1 times [2024-10-24 05:27:30,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:27:30,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580006816] [2024-10-24 05:27:30,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:27:30,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:27:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:27:31,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:27:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:27:31,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:27:31,129 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:27:31,130 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:27:31,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 05:27:31,135 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-24 05:27:31,244 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:27:31,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:27:31 BoogieIcfgContainer [2024-10-24 05:27:31,247 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:27:31,249 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:27:31,249 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:27:31,249 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:27:31,249 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:27:20" (3/4) ... [2024-10-24 05:27:31,251 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:27:31,252 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:27:31,253 INFO L158 Benchmark]: Toolchain (without parser) took 11577.23ms. Allocated memory was 130.0MB in the beginning and 234.9MB in the end (delta: 104.9MB). Free memory was 61.1MB in the beginning and 68.3MB in the end (delta: -7.3MB). Peak memory consumption was 99.1MB. Max. memory is 16.1GB. [2024-10-24 05:27:31,253 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 130.0MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:27:31,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.35ms. Allocated memory was 130.0MB in the beginning and 161.5MB in the end (delta: 31.5MB). Free memory was 61.1MB in the beginning and 129.5MB in the end (delta: -68.5MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-10-24 05:27:31,254 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.84ms. Allocated memory is still 161.5MB. Free memory was 129.5MB in the beginning and 124.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 05:27:31,254 INFO L158 Benchmark]: Boogie Preprocessor took 86.21ms. Allocated memory is still 161.5MB. Free memory was 124.3MB in the beginning and 118.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 05:27:31,254 INFO L158 Benchmark]: RCFGBuilder took 710.16ms. Allocated memory is still 161.5MB. Free memory was 118.0MB in the beginning and 86.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-24 05:27:31,254 INFO L158 Benchmark]: TraceAbstraction took 10344.59ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 85.5MB in the beginning and 68.3MB in the end (delta: 17.2MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. [2024-10-24 05:27:31,254 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 234.9MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:27:31,259 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.21ms. Allocated memory is still 130.0MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.35ms. Allocated memory was 130.0MB in the beginning and 161.5MB in the end (delta: 31.5MB). Free memory was 61.1MB in the beginning and 129.5MB in the end (delta: -68.5MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.84ms. Allocated memory is still 161.5MB. Free memory was 129.5MB in the beginning and 124.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.21ms. Allocated memory is still 161.5MB. Free memory was 124.3MB in the beginning and 118.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 710.16ms. Allocated memory is still 161.5MB. Free memory was 118.0MB in the beginning and 86.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10344.59ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 85.5MB in the beginning and 68.3MB in the end (delta: 17.2MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 234.9MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 139. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] unsigned short int var_1_2 = 16; [L24] unsigned short int var_1_3 = 32; [L25] unsigned char var_1_4 = 1; [L26] signed long int var_1_5 = 5; [L27] signed long int var_1_6 = 2; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] float var_1_9 = 128.6; [L31] float var_1_10 = 32.5; [L32] unsigned char var_1_11 = 16; [L33] unsigned char var_1_12 = 64; [L34] unsigned char var_1_13 = 4; [L35] unsigned char var_1_14 = 4; [L36] unsigned long int var_1_15 = 0; [L37] signed short int var_1_16 = 0; [L38] signed char var_1_17 = 1; [L39] signed char var_1_18 = -1; [L40] signed char var_1_19 = 0; [L41] signed long int var_1_20 = -64; [L42] signed long int var_1_21 = 25; [L43] unsigned char var_1_22 = 0; [L44] unsigned char var_1_23 = 0; [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L92] var_1_2 = __VERIFIER_nondet_ushort() [L93] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L93] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L94] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L94] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L95] var_1_3 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L96] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L97] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L97] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L98] var_1_4 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L99] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L100] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L100] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L101] var_1_6 = __VERIFIER_nondet_long() [L102] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L102] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L103] CALL assume_abort_if_not(var_1_6 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L103] RET assume_abort_if_not(var_1_6 <= 1073741823) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L104] var_1_7 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_8=0, var_1_9=643/5] [L105] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_8=0, var_1_9=643/5] [L106] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L106] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L107] var_1_9 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L108] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L109] var_1_10 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L110] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L111] var_1_11 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L112] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L113] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L113] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L114] var_1_12 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L115] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L116] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L116] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L117] var_1_13 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L118] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L119] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L119] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L120] var_1_14 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L121] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L122] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L122] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L123] var_1_18 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L124] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L125] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L125] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L126] var_1_19 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L127] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L128] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L128] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L129] var_1_21 = __VERIFIER_nondet_long() [L130] CALL assume_abort_if_not(var_1_21 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L130] RET assume_abort_if_not(var_1_21 >= -2147483647) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L131] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L131] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L132] var_1_23 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L133] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L134] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L134] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L147] RET updateVariables() [L148] CALL step() [L48] COND FALSE !((var_1_2 + var_1_3) < -200) [L59] var_1_1 = var_1_2 VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L61] COND TRUE 256 > (var_1_3 - (var_1_2 + var_1_6)) [L62] var_1_5 = var_1_2 VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L72] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L75] COND TRUE \read(var_1_7) [L76] var_1_15 = var_1_6 VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L78] var_1_16 = (((((var_1_8) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_8) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L79] COND FALSE !(\read(var_1_4)) [L86] var_1_17 = -32 VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L88] var_1_20 = var_1_21 [L89] var_1_22 = var_1_23 [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR (((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-2147483647, var_1_21=-2147483647, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L139] EXPR (256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-2147483647, var_1_21=-2147483647, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L139] EXPR (((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-2147483647, var_1_21=-2147483647, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L139] EXPR (((((((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_7 ? (var_1_15 == ((unsigned long int) var_1_6)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_8) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_8) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_4 ? ((var_1_14 < (var_1_13 & (var_1_16 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-2147483647, var_1_21=-2147483647, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L139-L140] return (((((((((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_7 ? (var_1_15 == ((unsigned long int) var_1_6)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_8) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_8) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_4 ? ((var_1_14 < (var_1_13 & (var_1_16 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_21))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-2147483647, var_1_21=-2147483647, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-2147483647, var_1_21=-2147483647, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 5, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 389 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 389 mSDsluCounter, 1585 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1122 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 579 IncrementalHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 463 mSDtfsCounter, 579 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 137 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 856 NumberOfCodeBlocks, 856 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 680 ConstructedInterpolants, 0 QuantifiedInterpolants, 5897 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 6048/6048 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 05:27:31,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.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 5f7089906045f68da9fc900e2f38b68a58c1b0c4f2e88e8e487f0f744e1e424c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:27:33,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:27:33,683 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:27:33,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:27:33,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:27:33,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:27:33,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:27:33,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:27:33,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:27:33,722 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:27:33,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:27:33,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:27:33,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:27:33,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:27:33,728 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:27:33,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:27:33,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:27:33,729 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:27:33,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:27:33,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:27:33,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:27:33,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:27:33,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:27:33,732 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:27:33,732 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:27:33,733 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:27:33,733 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:27:33,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:27:33,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:27:33,734 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:27:33,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:27:33,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:27:33,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:27:33,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:27:33,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:27:33,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:27:33,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:27:33,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:27:33,738 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:27:33,738 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:27:33,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:27:33,739 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:27:33,739 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:27:33,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:27:33,739 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:27:33,740 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 -> 5f7089906045f68da9fc900e2f38b68a58c1b0c4f2e88e8e487f0f744e1e424c [2024-10-24 05:27:34,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:27:34,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:27:34,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:27:34,141 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:27:34,143 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:27:34,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.i [2024-10-24 05:27:35,791 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:27:36,003 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:27:36,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.i [2024-10-24 05:27:36,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/077d88a0c/bb687f9c712743b3908e635dc7938d2b/FLAGa2a78a3de [2024-10-24 05:27:36,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/077d88a0c/bb687f9c712743b3908e635dc7938d2b [2024-10-24 05:27:36,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:27:36,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:27:36,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:27:36,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:27:36,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:27:36,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:27:36" (1/1) ... [2024-10-24 05:27:36,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee987cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:36, skipping insertion in model container [2024-10-24 05:27:36,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:27:36" (1/1) ... [2024-10-24 05:27:36,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:27:36,608 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.i[913,926] [2024-10-24 05:27:36,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:27:36,705 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:27:36,718 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.i[913,926] [2024-10-24 05:27:36,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:27:36,783 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:27:36,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:36 WrapperNode [2024-10-24 05:27:36,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:27:36,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:27:36,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:27:36,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:27:36,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:36" (1/1) ... [2024-10-24 05:27:36,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:36" (1/1) ... [2024-10-24 05:27:36,842 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2024-10-24 05:27:36,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:27:36,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:27:36,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:27:36,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:27:36,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:36" (1/1) ... [2024-10-24 05:27:36,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:36" (1/1) ... [2024-10-24 05:27:36,859 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:36" (1/1) ... [2024-10-24 05:27:36,876 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:27:36,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:36" (1/1) ... [2024-10-24 05:27:36,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:36" (1/1) ... [2024-10-24 05:27:36,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:36" (1/1) ... [2024-10-24 05:27:36,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:36" (1/1) ... [2024-10-24 05:27:36,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:36" (1/1) ... [2024-10-24 05:27:36,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:36" (1/1) ... [2024-10-24 05:27:36,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:27:36,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:27:36,913 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:27:36,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:27:36,914 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:36" (1/1) ... [2024-10-24 05:27:36,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:27:36,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:27:36,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:27:36,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:27:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:27:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:27:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:27:36,998 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:27:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:27:36,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:27:37,086 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:27:37,089 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:27:37,409 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:27:37,409 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:27:37,478 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:27:37,478 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:27:37,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:27:37 BoogieIcfgContainer [2024-10-24 05:27:37,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:27:37,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:27:37,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:27:37,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:27:37,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:27:36" (1/3) ... [2024-10-24 05:27:37,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c146e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:27:37, skipping insertion in model container [2024-10-24 05:27:37,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:27:36" (2/3) ... [2024-10-24 05:27:37,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c146e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:27:37, skipping insertion in model container [2024-10-24 05:27:37,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:27:37" (3/3) ... [2024-10-24 05:27:37,490 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-97.i [2024-10-24 05:27:37,509 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:27:37,509 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:27:37,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:27:37,584 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;@796b68e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:27:37,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:27:37,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 05:27:37,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 05:27:37,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:27:37,601 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:27:37,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:27:37,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:27:37,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1755704202, now seen corresponding path program 1 times [2024-10-24 05:27:37,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:27:37,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079950469] [2024-10-24 05:27:37,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:27:37,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:27:37,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:27:37,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:27:37,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 05:27:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:37,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:27:37,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:27:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 758 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-10-24 05:27:37,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:27:37,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:27:37,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079950469] [2024-10-24 05:27:37,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079950469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:27:37,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:27:37,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:27:37,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524598524] [2024-10-24 05:27:37,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:27:37,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:27:37,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:27:37,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:27:38,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:27:38,003 INFO L87 Difference]: Start difference. First operand has 67 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 05:27:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:27:38,055 INFO L93 Difference]: Finished difference Result 129 states and 236 transitions. [2024-10-24 05:27:38,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:27:38,059 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 166 [2024-10-24 05:27:38,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:27:38,067 INFO L225 Difference]: With dead ends: 129 [2024-10-24 05:27:38,068 INFO L226 Difference]: Without dead ends: 63 [2024-10-24 05:27:38,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:27:38,075 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:27:38,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:27:38,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-24 05:27:38,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-24 05:27:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 05:27:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 96 transitions. [2024-10-24 05:27:38,122 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 96 transitions. Word has length 166 [2024-10-24 05:27:38,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:27:38,122 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 96 transitions. [2024-10-24 05:27:38,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 05:27:38,123 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 96 transitions. [2024-10-24 05:27:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 05:27:38,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:27:38,127 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:27:38,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 05:27:38,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:27:38,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:27:38,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:27:38,329 INFO L85 PathProgramCache]: Analyzing trace with hash -33820338, now seen corresponding path program 1 times [2024-10-24 05:27:38,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:27:38,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794693885] [2024-10-24 05:27:38,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:27:38,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:27:38,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:27:38,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:27:38,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 05:27:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:27:38,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-24 05:27:38,736 INFO L278 TraceCheckSpWp]: Computing forward predicates...