./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-68.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 59f9b6dc260e19b867852db23250c8f2678f4f2ad196a31f4b91ae3706156d51 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 20:48:14,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 20:48:14,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 20:48:14,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 20:48:14,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 20:48:14,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 20:48:14,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 20:48:14,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 20:48:14,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 20:48:14,307 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 20:48:14,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 20:48:14,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 20:48:14,308 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 20:48:14,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 20:48:14,310 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 20:48:14,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 20:48:14,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 20:48:14,310 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 20:48:14,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 20:48:14,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 20:48:14,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 20:48:14,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 20:48:14,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 20:48:14,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 20:48:14,315 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 20:48:14,315 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 20:48:14,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 20:48:14,315 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 20:48:14,316 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 20:48:14,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 20:48:14,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 20:48:14,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 20:48:14,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:48:14,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 20:48:14,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 20:48:14,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 20:48:14,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 20:48:14,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 20:48:14,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 20:48:14,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 20:48:14,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 20:48:14,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 20:48:14,318 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 -> 59f9b6dc260e19b867852db23250c8f2678f4f2ad196a31f4b91ae3706156d51 [2024-11-18 20:48:14,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 20:48:14,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 20:48:14,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 20:48:14,600 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 20:48:14,601 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 20:48:14,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-68.i [2024-11-18 20:48:16,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 20:48:16,335 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 20:48:16,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-68.i [2024-11-18 20:48:16,348 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b49d183e1/663167bbd1c944f7b358c8ad99331008/FLAG29f030c8d [2024-11-18 20:48:16,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b49d183e1/663167bbd1c944f7b358c8ad99331008 [2024-11-18 20:48:16,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 20:48:16,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 20:48:16,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 20:48:16,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 20:48:16,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 20:48:16,709 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:48:16" (1/1) ... [2024-11-18 20:48:16,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e103e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:16, skipping insertion in model container [2024-11-18 20:48:16,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:48:16" (1/1) ... [2024-11-18 20:48:16,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 20:48:17,020 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-68.i[919,932] [2024-11-18 20:48:17,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:48:17,077 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 20:48:17,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-68.i[919,932] [2024-11-18 20:48:17,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:48:17,131 INFO L204 MainTranslator]: Completed translation [2024-11-18 20:48:17,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:17 WrapperNode [2024-11-18 20:48:17,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 20:48:17,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 20:48:17,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 20:48:17,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 20:48:17,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:17" (1/1) ... [2024-11-18 20:48:17,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:17" (1/1) ... [2024-11-18 20:48:17,192 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2024-11-18 20:48:17,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 20:48:17,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 20:48:17,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 20:48:17,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 20:48:17,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:17" (1/1) ... [2024-11-18 20:48:17,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:17" (1/1) ... [2024-11-18 20:48:17,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:17" (1/1) ... [2024-11-18 20:48:17,264 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 20:48:17,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:17" (1/1) ... [2024-11-18 20:48:17,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:17" (1/1) ... [2024-11-18 20:48:17,273 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:17" (1/1) ... [2024-11-18 20:48:17,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:17" (1/1) ... [2024-11-18 20:48:17,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:17" (1/1) ... [2024-11-18 20:48:17,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:17" (1/1) ... [2024-11-18 20:48:17,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 20:48:17,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 20:48:17,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 20:48:17,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 20:48:17,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:17" (1/1) ... [2024-11-18 20:48:17,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:48:17,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:48:17,341 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 20:48:17,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 20:48:17,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 20:48:17,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 20:48:17,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 20:48:17,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 20:48:17,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 20:48:17,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 20:48:17,461 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 20:48:17,463 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 20:48:17,768 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-18 20:48:17,769 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 20:48:17,784 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 20:48:17,784 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 20:48:17,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:48:17 BoogieIcfgContainer [2024-11-18 20:48:17,785 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 20:48:17,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 20:48:17,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 20:48:17,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 20:48:17,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:48:16" (1/3) ... [2024-11-18 20:48:17,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c5081f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:48:17, skipping insertion in model container [2024-11-18 20:48:17,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:17" (2/3) ... [2024-11-18 20:48:17,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c5081f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:48:17, skipping insertion in model container [2024-11-18 20:48:17,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:48:17" (3/3) ... [2024-11-18 20:48:17,791 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-68.i [2024-11-18 20:48:17,807 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 20:48:17,807 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 20:48:17,867 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 20:48:17,872 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;@81084f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 20:48:17,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 20:48:17,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 73 states have internal predecessors, (109), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 20:48:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-18 20:48:17,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:17,891 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:48:17,891 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:17,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:17,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1987934496, now seen corresponding path program 1 times [2024-11-18 20:48:17,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:48:17,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033883586] [2024-11-18 20:48:17,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:17,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:48:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-18 20:48:18,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:48:18,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033883586] [2024-11-18 20:48:18,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033883586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:48:18,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106382040] [2024-11-18 20:48:18,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:18,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:48:18,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:48:18,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 20:48:18,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 20:48:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:18,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 20:48:18,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:48:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-18 20:48:18,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:48:18,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106382040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:48:18,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 20:48:18,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 20:48:18,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332860243] [2024-11-18 20:48:18,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:48:18,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 20:48:18,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:48:18,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 20:48:18,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 20:48:18,460 INFO L87 Difference]: Start difference. First operand has 93 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 73 states have internal predecessors, (109), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:48:18,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:48:18,488 INFO L93 Difference]: Finished difference Result 175 states and 297 transitions. [2024-11-18 20:48:18,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 20:48:18,490 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 133 [2024-11-18 20:48:18,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:48:18,496 INFO L225 Difference]: With dead ends: 175 [2024-11-18 20:48:18,497 INFO L226 Difference]: Without dead ends: 85 [2024-11-18 20:48:18,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 20:48:18,504 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 20:48:18,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:48:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-18 20:48:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-18 20:48:18,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 65 states have internal predecessors, (94), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 20:48:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 130 transitions. [2024-11-18 20:48:18,541 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 130 transitions. Word has length 133 [2024-11-18 20:48:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:48:18,542 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 130 transitions. [2024-11-18 20:48:18,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:48:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 130 transitions. [2024-11-18 20:48:18,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-18 20:48:18,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:18,547 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:48:18,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 20:48:18,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 20:48:18,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:18,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:18,749 INFO L85 PathProgramCache]: Analyzing trace with hash 27773856, now seen corresponding path program 1 times [2024-11-18 20:48:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:48:18,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101122773] [2024-11-18 20:48:18,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:18,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:48:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:48:19,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:48:19,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101122773] [2024-11-18 20:48:19,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101122773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:48:19,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:48:19,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:48:19,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708369703] [2024-11-18 20:48:19,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:48:19,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 20:48:19,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:48:19,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 20:48:19,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:48:19,024 INFO L87 Difference]: Start difference. First operand 85 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:48:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:48:19,134 INFO L93 Difference]: Finished difference Result 167 states and 257 transitions. [2024-11-18 20:48:19,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 20:48:19,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2024-11-18 20:48:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:48:19,136 INFO L225 Difference]: With dead ends: 167 [2024-11-18 20:48:19,136 INFO L226 Difference]: Without dead ends: 85 [2024-11-18 20:48:19,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:48:19,138 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 116 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 20:48:19,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 186 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 20:48:19,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-18 20:48:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-18 20:48:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 65 states have internal predecessors, (93), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 20:48:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 129 transitions. [2024-11-18 20:48:19,156 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 129 transitions. Word has length 133 [2024-11-18 20:48:19,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:48:19,158 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 129 transitions. [2024-11-18 20:48:19,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:48:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 129 transitions. [2024-11-18 20:48:19,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-18 20:48:19,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:19,164 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:48:19,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 20:48:19,165 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:19,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:19,166 INFO L85 PathProgramCache]: Analyzing trace with hash 390733979, now seen corresponding path program 1 times [2024-11-18 20:48:19,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:48:19,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260097685] [2024-11-18 20:48:19,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:19,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:48:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:48:19,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:48:19,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260097685] [2024-11-18 20:48:19,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260097685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:48:19,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:48:19,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 20:48:19,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474093499] [2024-11-18 20:48:19,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:48:19,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 20:48:19,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:48:19,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 20:48:19,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:48:19,418 INFO L87 Difference]: Start difference. First operand 85 states and 129 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:48:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:48:19,529 INFO L93 Difference]: Finished difference Result 173 states and 266 transitions. [2024-11-18 20:48:19,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 20:48:19,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2024-11-18 20:48:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:48:19,531 INFO L225 Difference]: With dead ends: 173 [2024-11-18 20:48:19,531 INFO L226 Difference]: Without dead ends: 91 [2024-11-18 20:48:19,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 20:48:19,533 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 10 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 20:48:19,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 428 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 20:48:19,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-18 20:48:19,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2024-11-18 20:48:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 69 states have internal predecessors, (100), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 20:48:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 136 transitions. [2024-11-18 20:48:19,549 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 136 transitions. Word has length 134 [2024-11-18 20:48:19,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:48:19,550 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 136 transitions. [2024-11-18 20:48:19,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:48:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 136 transitions. [2024-11-18 20:48:19,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-18 20:48:19,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:19,552 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:48:19,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 20:48:19,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:19,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:19,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1414704355, now seen corresponding path program 1 times [2024-11-18 20:48:19,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:48:19,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371364285] [2024-11-18 20:48:19,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:19,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:48:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:48:20,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:48:20,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371364285] [2024-11-18 20:48:20,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371364285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:48:20,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:48:20,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 20:48:20,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848133] [2024-11-18 20:48:20,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:48:20,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 20:48:20,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:48:20,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 20:48:20,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-18 20:48:20,521 INFO L87 Difference]: Start difference. First operand 89 states and 136 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:48:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:48:21,046 INFO L93 Difference]: Finished difference Result 355 states and 541 transitions. [2024-11-18 20:48:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 20:48:21,047 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 134 [2024-11-18 20:48:21,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:48:21,050 INFO L225 Difference]: With dead ends: 355 [2024-11-18 20:48:21,051 INFO L226 Difference]: Without dead ends: 269 [2024-11-18 20:48:21,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-18 20:48:21,053 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 501 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 20:48:21,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 600 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 20:48:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-18 20:48:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 150. [2024-11-18 20:48:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 110 states have (on average 1.4272727272727272) internal successors, (157), 110 states have internal predecessors, (157), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-18 20:48:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 229 transitions. [2024-11-18 20:48:21,081 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 229 transitions. Word has length 134 [2024-11-18 20:48:21,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:48:21,081 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 229 transitions. [2024-11-18 20:48:21,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:48:21,081 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 229 transitions. [2024-11-18 20:48:21,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-18 20:48:21,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:21,085 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:48:21,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 20:48:21,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:21,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:21,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1259288459, now seen corresponding path program 1 times [2024-11-18 20:48:21,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:48:21,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374227448] [2024-11-18 20:48:21,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:21,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:48:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:48:21,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:48:21,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374227448] [2024-11-18 20:48:21,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374227448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:48:21,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:48:21,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 20:48:21,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018597131] [2024-11-18 20:48:21,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:48:21,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 20:48:21,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:48:21,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 20:48:21,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-18 20:48:21,502 INFO L87 Difference]: Start difference. First operand 150 states and 229 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:48:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:48:21,953 INFO L93 Difference]: Finished difference Result 355 states and 540 transitions. [2024-11-18 20:48:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 20:48:21,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 135 [2024-11-18 20:48:21,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:48:21,959 INFO L225 Difference]: With dead ends: 355 [2024-11-18 20:48:21,959 INFO L226 Difference]: Without dead ends: 269 [2024-11-18 20:48:21,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-18 20:48:21,961 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 421 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 20:48:21,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 508 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 20:48:21,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-18 20:48:21,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 151. [2024-11-18 20:48:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 111 states have (on average 1.4234234234234233) internal successors, (158), 111 states have internal predecessors, (158), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-18 20:48:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 230 transitions. [2024-11-18 20:48:21,985 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 230 transitions. Word has length 135 [2024-11-18 20:48:21,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:48:21,986 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 230 transitions. [2024-11-18 20:48:21,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:48:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2024-11-18 20:48:21,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-18 20:48:21,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:21,987 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:48:21,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 20:48:21,991 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:21,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:21,991 INFO L85 PathProgramCache]: Analyzing trace with hash -836586633, now seen corresponding path program 1 times [2024-11-18 20:48:21,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:48:21,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411788512] [2024-11-18 20:48:21,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:21,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:48:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-18 20:48:22,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:48:22,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411788512] [2024-11-18 20:48:22,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411788512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:48:22,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457126397] [2024-11-18 20:48:22,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:22,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:48:22,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:48:22,255 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 20:48:22,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 20:48:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:22,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 20:48:22,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:48:22,659 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-18 20:48:22,660 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:48:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-18 20:48:22,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457126397] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 20:48:22,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 20:48:22,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 10 [2024-11-18 20:48:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868249633] [2024-11-18 20:48:22,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 20:48:22,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 20:48:22,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:48:22,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 20:48:22,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-18 20:48:22,869 INFO L87 Difference]: Start difference. First operand 151 states and 230 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-18 20:48:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:48:23,255 INFO L93 Difference]: Finished difference Result 383 states and 567 transitions. [2024-11-18 20:48:23,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-18 20:48:23,256 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 135 [2024-11-18 20:48:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:48:23,258 INFO L225 Difference]: With dead ends: 383 [2024-11-18 20:48:23,259 INFO L226 Difference]: Without dead ends: 297 [2024-11-18 20:48:23,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 266 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2024-11-18 20:48:23,261 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 301 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 20:48:23,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 636 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 20:48:23,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-18 20:48:23,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 281. [2024-11-18 20:48:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 216 states have (on average 1.3981481481481481) internal successors, (302), 217 states have internal predecessors, (302), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-18 20:48:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 414 transitions. [2024-11-18 20:48:23,290 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 414 transitions. Word has length 135 [2024-11-18 20:48:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:48:23,291 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 414 transitions. [2024-11-18 20:48:23,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-18 20:48:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 414 transitions. [2024-11-18 20:48:23,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-18 20:48:23,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:23,292 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:48:23,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 20:48:23,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-18 20:48:23,494 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:23,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:23,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1229613643, now seen corresponding path program 1 times [2024-11-18 20:48:23,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:48:23,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561303623] [2024-11-18 20:48:23,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:23,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:48:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 20:48:23,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1145481689] [2024-11-18 20:48:23,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:23,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:48:23,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:48:23,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 20:48:23,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 20:48:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 20:48:23,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 20:48:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 20:48:23,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 20:48:23,794 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 20:48:23,795 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 20:48:23,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 20:48:23,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:48:24,000 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:48:24,077 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 20:48:24,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:48:24 BoogieIcfgContainer [2024-11-18 20:48:24,079 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 20:48:24,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 20:48:24,080 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 20:48:24,080 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 20:48:24,080 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:48:17" (3/4) ... [2024-11-18 20:48:24,082 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 20:48:24,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 20:48:24,083 INFO L158 Benchmark]: Toolchain (without parser) took 7389.70ms. Allocated memory was 195.0MB in the beginning and 264.2MB in the end (delta: 69.2MB). Free memory was 126.0MB in the beginning and 151.1MB in the end (delta: -25.1MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2024-11-18 20:48:24,083 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 20:48:24,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.74ms. Allocated memory is still 195.0MB. Free memory was 126.0MB in the beginning and 109.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 20:48:24,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.55ms. Allocated memory is still 195.0MB. Free memory was 109.2MB in the beginning and 104.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 20:48:24,084 INFO L158 Benchmark]: Boogie Preprocessor took 101.07ms. Allocated memory is still 195.0MB. Free memory was 104.5MB in the beginning and 161.2MB in the end (delta: -56.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-18 20:48:24,084 INFO L158 Benchmark]: RCFGBuilder took 486.05ms. Allocated memory is still 195.0MB. Free memory was 161.2MB in the beginning and 131.3MB in the end (delta: 30.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-18 20:48:24,085 INFO L158 Benchmark]: TraceAbstraction took 6292.99ms. Allocated memory was 195.0MB in the beginning and 264.2MB in the end (delta: 69.2MB). Free memory was 131.0MB in the beginning and 152.2MB in the end (delta: -21.2MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2024-11-18 20:48:24,085 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 264.2MB. Free memory was 152.2MB in the beginning and 151.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 20:48:24,086 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.13ms. Allocated memory is still 109.1MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.74ms. Allocated memory is still 195.0MB. Free memory was 126.0MB in the beginning and 109.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.55ms. Allocated memory is still 195.0MB. Free memory was 109.2MB in the beginning and 104.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.07ms. Allocated memory is still 195.0MB. Free memory was 104.5MB in the beginning and 161.2MB in the end (delta: -56.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 486.05ms. Allocated memory is still 195.0MB. Free memory was 161.2MB in the beginning and 131.3MB in the end (delta: 30.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6292.99ms. Allocated memory was 195.0MB in the beginning and 264.2MB in the end (delta: 69.2MB). Free memory was 131.0MB in the beginning and 152.2MB in the end (delta: -21.2MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 264.2MB. Free memory was 152.2MB in the beginning and 151.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 170, overapproximation of someBinaryFLOATComparisonOperation at line 170. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 32; [L27] double var_1_9 = 4.6; [L28] double var_1_10 = 9.25; [L29] double var_1_11 = 1.25; [L30] unsigned char var_1_12 = 100; [L31] unsigned char var_1_13 = 64; [L32] unsigned char var_1_14 = 0; [L33] float var_1_15 = 7.5; [L34] signed long int var_1_16 = 0; [L35] unsigned char var_1_17 = 1; [L36] double var_1_21 = 4.65; [L37] double var_1_23 = 9999999999.1; [L38] double var_1_24 = 5.5; [L39] unsigned short int var_1_25 = 16; [L40] signed long int var_1_27 = 32; [L41] signed char var_1_31 = 32; [L42] signed char var_1_32 = 32; [L43] signed short int var_1_33 = 100; [L44] unsigned char var_1_34 = 1; [L45] double var_1_35 = 3.8; [L46] signed short int var_1_37 = -256; [L47] unsigned short int var_1_38 = 4; [L48] double last_1_var_1_9 = 4.6; [L49] unsigned char last_1_var_1_12 = 100; [L50] unsigned char last_1_var_1_14 = 0; [L51] signed long int last_1_var_1_16 = 0; VAL [isInitial=0, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L174] isInitial = 1 [L175] FCALL initially() [L176] COND TRUE 1 [L177] CALL updateLastVariables() [L164] last_1_var_1_9 = var_1_9 [L165] last_1_var_1_12 = var_1_12 [L166] last_1_var_1_14 = var_1_14 [L167] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L177] RET updateLastVariables() [L178] CALL updateVariables() [L134] var_1_5 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L135] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L136] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L136] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L137] var_1_7 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L138] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L139] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L139] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L140] var_1_8 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L141] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L142] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L142] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L143] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L143] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L144] var_1_10 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L145] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L146] var_1_13 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L147] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L148] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L148] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L149] var_1_23 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L150] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L151] var_1_24 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L152] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L153] var_1_31 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_31 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L154] RET assume_abort_if_not(var_1_31 >= -127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L155] CALL assume_abort_if_not(var_1_31 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L155] RET assume_abort_if_not(var_1_31 <= 127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L156] var_1_32 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L157] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L158] CALL assume_abort_if_not(var_1_32 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L158] RET assume_abort_if_not(var_1_32 <= 127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L159] var_1_35 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L160] RET assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L161] CALL assume_abort_if_not(var_1_35 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L161] RET assume_abort_if_not(var_1_35 != 0.0F) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L178] RET updateVariables() [L179] CALL step() [L55] signed long int stepLocal_4 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L56] COND FALSE !(\read(last_1_var_1_14)) [L67] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L69] var_1_16 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L70] COND FALSE !(var_1_31 >= var_1_32) [L75] var_1_34 = ((var_1_24 >= (var_1_10 / var_1_35)) || var_1_7) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L77] EXPR var_1_13 | var_1_13 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L77] EXPR var_1_12 ^ (var_1_13 | var_1_13) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L77] EXPR var_1_31 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L77] COND FALSE !((var_1_12 ^ (var_1_13 | var_1_13)) < (var_1_31 ^ var_1_12)) [L80] unsigned long int stepLocal_6 = var_1_13 % (5u + 256u); [L81] signed long int stepLocal_5 = var_1_13 + 16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, stepLocal_6=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L82] COND TRUE stepLocal_6 <= var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L83] COND FALSE !(stepLocal_5 >= var_1_16) [L86] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L89] var_1_38 = var_1_12 [L90] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L91] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L91] COND TRUE stepLocal_0 <= (var_1_12 ^ var_1_12) [L92] var_1_1 = (! var_1_5) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L96] unsigned char stepLocal_2 = var_1_12 < (var_1_16 / var_1_8); [L97] signed long int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_1=100, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L98] COND FALSE !(-256 >= stepLocal_1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L101] COND TRUE stepLocal_2 || ((var_1_5 && var_1_7) && var_1_1) [L102] var_1_6 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L105] var_1_25 = var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L106] COND FALSE !(((((var_1_10) > (var_1_24)) ? (var_1_10) : (var_1_24))) > var_1_23) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L119] unsigned char stepLocal_3 = ! var_1_5; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_3=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L120] COND TRUE (var_1_7 && var_1_14) || stepLocal_3 [L121] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L123] COND FALSE !(! var_1_14) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L126] var_1_15 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L127] COND TRUE ((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8) [L128] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] [L130] var_1_17 = (var_1_5 || (var_1_7 && var_1_5)) [L131] var_1_33 = var_1_31 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] [L179] RET step() [L180] CALL, EXPR property() [L170] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] [L170-L171] return ((((((((var_1_12 <= (var_1_12 ^ var_1_12)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_16) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_12 < (var_1_16 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_14) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (last_1_var_1_14 ? ((var_1_10 >= (- last_1_var_1_9)) ? ((var_1_8 != last_1_var_1_16) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_16) ? (((var_1_13 + 16) >= var_1_16) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) last_1_var_1_12)) ; [L180] RET, EXPR property() [L180] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1354 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1349 mSDsluCounter, 2488 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1795 mSDsCounter, 208 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1301 IncrementalHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 208 mSolverCounterUnsat, 693 mSDtfsCounter, 1301 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 469 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=6, InterpolantAutomatonStates: 48, 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, 6 MinimizatonAttempts, 255 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1342 NumberOfCodeBlocks, 1342 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1198 ConstructedInterpolants, 0 QuantifiedInterpolants, 3257 SizeOfPredicates, 2 NumberOfNonLiveVariables, 706 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 5339/5508 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 20:48:24,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-68.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 59f9b6dc260e19b867852db23250c8f2678f4f2ad196a31f4b91ae3706156d51 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 20:48:26,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 20:48:26,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 20:48:26,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 20:48:26,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 20:48:26,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 20:48:26,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 20:48:26,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 20:48:26,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 20:48:26,305 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 20:48:26,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 20:48:26,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 20:48:26,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 20:48:26,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 20:48:26,307 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 20:48:26,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 20:48:26,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 20:48:26,309 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 20:48:26,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 20:48:26,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 20:48:26,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 20:48:26,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 20:48:26,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 20:48:26,311 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 20:48:26,311 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 20:48:26,311 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 20:48:26,312 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 20:48:26,312 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 20:48:26,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 20:48:26,312 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 20:48:26,313 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 20:48:26,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 20:48:26,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 20:48:26,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 20:48:26,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:48:26,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 20:48:26,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 20:48:26,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 20:48:26,314 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 20:48:26,315 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 20:48:26,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 20:48:26,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 20:48:26,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 20:48:26,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 20:48:26,320 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 -> 59f9b6dc260e19b867852db23250c8f2678f4f2ad196a31f4b91ae3706156d51 [2024-11-18 20:48:26,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 20:48:26,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 20:48:26,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 20:48:26,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 20:48:26,765 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 20:48:26,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-68.i [2024-11-18 20:48:28,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 20:48:28,417 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 20:48:28,417 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-68.i [2024-11-18 20:48:28,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f611f347/a971eda502a04fa7a1d1aa9bf114fbf1/FLAG6b66f95a4 [2024-11-18 20:48:28,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f611f347/a971eda502a04fa7a1d1aa9bf114fbf1 [2024-11-18 20:48:28,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 20:48:28,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 20:48:28,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 20:48:28,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 20:48:28,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 20:48:28,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:48:28" (1/1) ... [2024-11-18 20:48:28,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78292865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:28, skipping insertion in model container [2024-11-18 20:48:28,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:48:28" (1/1) ... [2024-11-18 20:48:28,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 20:48:28,602 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-68.i[919,932] [2024-11-18 20:48:28,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:48:28,684 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 20:48:28,693 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-68.i[919,932] [2024-11-18 20:48:28,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:48:28,746 INFO L204 MainTranslator]: Completed translation [2024-11-18 20:48:28,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:28 WrapperNode [2024-11-18 20:48:28,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 20:48:28,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 20:48:28,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 20:48:28,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 20:48:28,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:28" (1/1) ... [2024-11-18 20:48:28,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:28" (1/1) ... [2024-11-18 20:48:28,800 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-11-18 20:48:28,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 20:48:28,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 20:48:28,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 20:48:28,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 20:48:28,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:28" (1/1) ... [2024-11-18 20:48:28,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:28" (1/1) ... [2024-11-18 20:48:28,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:28" (1/1) ... [2024-11-18 20:48:28,837 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 20:48:28,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:28" (1/1) ... [2024-11-18 20:48:28,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:28" (1/1) ... [2024-11-18 20:48:28,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:28" (1/1) ... [2024-11-18 20:48:28,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:28" (1/1) ... [2024-11-18 20:48:28,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:28" (1/1) ... [2024-11-18 20:48:28,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:28" (1/1) ... [2024-11-18 20:48:28,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 20:48:28,871 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 20:48:28,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 20:48:28,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 20:48:28,871 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:28" (1/1) ... [2024-11-18 20:48:28,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:48:28,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:48:28,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 20:48:28,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 20:48:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 20:48:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 20:48:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 20:48:28,981 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 20:48:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 20:48:28,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 20:48:29,072 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 20:48:29,074 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 20:48:34,010 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-18 20:48:34,010 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 20:48:34,030 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 20:48:34,031 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 20:48:34,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:48:34 BoogieIcfgContainer [2024-11-18 20:48:34,031 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 20:48:34,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 20:48:34,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 20:48:34,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 20:48:34,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:48:28" (1/3) ... [2024-11-18 20:48:34,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9868bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:48:34, skipping insertion in model container [2024-11-18 20:48:34,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:48:28" (2/3) ... [2024-11-18 20:48:34,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9868bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:48:34, skipping insertion in model container [2024-11-18 20:48:34,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:48:34" (3/3) ... [2024-11-18 20:48:34,051 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-68.i [2024-11-18 20:48:34,066 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 20:48:34,066 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 20:48:34,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 20:48:34,186 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;@2f087df0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 20:48:34,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 20:48:34,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 53 states have internal predecessors, (75), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 20:48:34,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-18 20:48:34,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:34,208 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:48:34,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:34,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:34,215 INFO L85 PathProgramCache]: Analyzing trace with hash 675350181, now seen corresponding path program 1 times [2024-11-18 20:48:34,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:48:34,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304769014] [2024-11-18 20:48:34,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:34,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:48:34,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:48:34,233 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:48:34,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-18 20:48:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:35,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 20:48:35,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:48:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-18 20:48:35,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:48:35,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:48:35,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304769014] [2024-11-18 20:48:35,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304769014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:48:35,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:48:35,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 20:48:35,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586926558] [2024-11-18 20:48:35,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:48:35,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 20:48:35,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:48:35,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 20:48:35,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 20:48:35,137 INFO L87 Difference]: Start difference. First operand has 73 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 53 states have internal predecessors, (75), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:48:35,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:48:35,157 INFO L93 Difference]: Finished difference Result 139 states and 234 transitions. [2024-11-18 20:48:35,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 20:48:35,163 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 127 [2024-11-18 20:48:35,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:48:35,171 INFO L225 Difference]: With dead ends: 139 [2024-11-18 20:48:35,172 INFO L226 Difference]: Without dead ends: 69 [2024-11-18 20:48:35,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 20:48:35,180 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 20:48:35,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:48:35,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-18 20:48:35,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-18 20:48:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 20:48:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2024-11-18 20:48:35,228 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 127 [2024-11-18 20:48:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:48:35,228 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2024-11-18 20:48:35,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:48:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2024-11-18 20:48:35,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-18 20:48:35,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:35,232 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:48:35,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 20:48:35,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:48:35,433 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:35,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:35,434 INFO L85 PathProgramCache]: Analyzing trace with hash -471278747, now seen corresponding path program 1 times [2024-11-18 20:48:35,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:48:35,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112602866] [2024-11-18 20:48:35,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:35,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:48:35,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:48:35,441 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:48:35,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-18 20:48:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:36,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 20:48:36,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:48:38,873 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:48:38,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:48:38,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:48:38,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112602866] [2024-11-18 20:48:38,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112602866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:48:38,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:48:38,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 20:48:38,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055104439] [2024-11-18 20:48:38,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:48:38,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 20:48:38,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:48:38,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 20:48:38,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-18 20:48:38,877 INFO L87 Difference]: Start difference. First operand 69 states and 104 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:48:45,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:48:45,331 INFO L93 Difference]: Finished difference Result 312 states and 468 transitions. [2024-11-18 20:48:45,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-18 20:48:45,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-18 20:48:45,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:48:45,343 INFO L225 Difference]: With dead ends: 312 [2024-11-18 20:48:45,343 INFO L226 Difference]: Without dead ends: 246 [2024-11-18 20:48:45,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-18 20:48:45,345 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 392 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-18 20:48:45,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 526 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-18 20:48:45,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-18 20:48:45,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 207. [2024-11-18 20:48:45,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 139 states have (on average 1.3453237410071943) internal successors, (187), 141 states have internal predecessors, (187), 62 states have call successors, (62), 5 states have call predecessors, (62), 5 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-18 20:48:45,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 311 transitions. [2024-11-18 20:48:45,391 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 311 transitions. Word has length 127 [2024-11-18 20:48:45,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:48:45,392 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 311 transitions. [2024-11-18 20:48:45,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:48:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 311 transitions. [2024-11-18 20:48:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-18 20:48:45,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:45,393 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:48:45,417 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-18 20:48:45,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:48:45,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:45,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:45,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1751142425, now seen corresponding path program 1 times [2024-11-18 20:48:45,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:48:45,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080808701] [2024-11-18 20:48:45,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:45,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:48:45,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:48:45,606 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:48:45,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-18 20:48:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:46,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 20:48:46,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:48:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:48:46,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:48:46,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:48:46,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080808701] [2024-11-18 20:48:46,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080808701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:48:46,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:48:46,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:48:46,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368573145] [2024-11-18 20:48:46,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:48:46,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 20:48:46,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:48:46,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 20:48:46,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:48:46,669 INFO L87 Difference]: Start difference. First operand 207 states and 311 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:48:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:48:47,409 INFO L93 Difference]: Finished difference Result 357 states and 535 transitions. [2024-11-18 20:48:47,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 20:48:47,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-18 20:48:47,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:48:47,434 INFO L225 Difference]: With dead ends: 357 [2024-11-18 20:48:47,434 INFO L226 Difference]: Without dead ends: 207 [2024-11-18 20:48:47,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:48:47,442 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 95 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 20:48:47,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 173 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 20:48:47,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-18 20:48:47,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-18 20:48:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 139 states have (on average 1.3237410071942446) internal successors, (184), 141 states have internal predecessors, (184), 62 states have call successors, (62), 5 states have call predecessors, (62), 5 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-18 20:48:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 308 transitions. [2024-11-18 20:48:47,508 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 308 transitions. Word has length 127 [2024-11-18 20:48:47,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:48:47,509 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 308 transitions. [2024-11-18 20:48:47,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:48:47,509 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 308 transitions. [2024-11-18 20:48:47,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-18 20:48:47,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:48:47,511 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:48:47,531 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 (4)] Ended with exit code 0 [2024-11-18 20:48:47,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:48:47,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:48:47,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:48:47,718 INFO L85 PathProgramCache]: Analyzing trace with hash -731947055, now seen corresponding path program 1 times [2024-11-18 20:48:47,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:48:47,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480892758] [2024-11-18 20:48:47,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:48:47,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:48:47,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:48:47,722 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:48:47,722 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 (5)] Waiting until timeout for monitored process [2024-11-18 20:48:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:48:48,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-18 20:48:48,460 INFO L278 TraceCheckSpWp]: Computing forward predicates...