./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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-ps-co_file-11.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 6d1e5e5cc6398246832802a812900af1b138e1125bfe18c91f7c567300bec7d3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:33:17,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:33:17,821 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:33:17,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:33:17,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:33:17,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:33:17,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:33:17,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:33:17,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:33:17,864 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:33:17,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:33:17,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:33:17,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:33:17,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:33:17,868 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:33:17,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:33:17,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:33:17,872 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:33:17,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:33:17,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:33:17,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:33:17,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:33:17,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:33:17,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:33:17,875 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:33:17,875 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:33:17,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:33:17,875 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:33:17,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:33:17,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:33:17,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:33:17,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:33:17,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:33:17,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:33:17,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:33:17,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:33:17,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:33:17,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:33:17,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:33:17,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:33:17,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:33:17,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:33:17,880 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 -> 6d1e5e5cc6398246832802a812900af1b138e1125bfe18c91f7c567300bec7d3 [2024-11-08 22:33:18,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:33:18,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:33:18,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:33:18,189 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:33:18,192 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:33:18,193 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-ps-co_file-11.i [2024-11-08 22:33:19,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:33:19,833 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:33:19,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-11.i [2024-11-08 22:33:19,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c65d5d2e9/dd998801408a462ba01e8115b037bd86/FLAG11c68b047 [2024-11-08 22:33:20,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c65d5d2e9/dd998801408a462ba01e8115b037bd86 [2024-11-08 22:33:20,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:33:20,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:33:20,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:33:20,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:33:20,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:33:20,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:33:20" (1/1) ... [2024-11-08 22:33:20,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7c6312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:20, skipping insertion in model container [2024-11-08 22:33:20,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:33:20" (1/1) ... [2024-11-08 22:33:20,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:33:20,432 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-ps-co_file-11.i[919,932] [2024-11-08 22:33:20,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:33:20,524 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:33:20,541 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-ps-co_file-11.i[919,932] [2024-11-08 22:33:20,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:33:20,608 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:33:20,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:20 WrapperNode [2024-11-08 22:33:20,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:33:20,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:33:20,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:33:20,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:33:20,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:20" (1/1) ... [2024-11-08 22:33:20,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:20" (1/1) ... [2024-11-08 22:33:20,660 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 222 [2024-11-08 22:33:20,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:33:20,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:33:20,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:33:20,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:33:20,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:20" (1/1) ... [2024-11-08 22:33:20,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:20" (1/1) ... [2024-11-08 22:33:20,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:20" (1/1) ... [2024-11-08 22:33:20,701 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-08 22:33:20,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:20" (1/1) ... [2024-11-08 22:33:20,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:20" (1/1) ... [2024-11-08 22:33:20,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:20" (1/1) ... [2024-11-08 22:33:20,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:20" (1/1) ... [2024-11-08 22:33:20,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:20" (1/1) ... [2024-11-08 22:33:20,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:20" (1/1) ... [2024-11-08 22:33:20,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:33:20,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:33:20,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:33:20,732 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:33:20,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:20" (1/1) ... [2024-11-08 22:33:20,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:33:20,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:33:20,774 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-08 22:33:20,780 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-08 22:33:20,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:33:20,833 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:33:20,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:33:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:33:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:33:20,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:33:20,917 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:33:20,918 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:33:21,409 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-08 22:33:21,409 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:33:21,429 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:33:21,430 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:33:21,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:33:21 BoogieIcfgContainer [2024-11-08 22:33:21,431 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:33:21,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:33:21,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:33:21,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:33:21,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:33:20" (1/3) ... [2024-11-08 22:33:21,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587119c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:33:21, skipping insertion in model container [2024-11-08 22:33:21,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:20" (2/3) ... [2024-11-08 22:33:21,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587119c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:33:21, skipping insertion in model container [2024-11-08 22:33:21,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:33:21" (3/3) ... [2024-11-08 22:33:21,443 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-11.i [2024-11-08 22:33:21,462 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:33:21,463 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:33:21,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:33:21,524 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;@80daddc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:33:21,525 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:33:21,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 64 states have (on average 1.484375) internal successors, (95), 65 states have internal predecessors, (95), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 22:33:21,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-08 22:33:21,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:21,546 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:33:21,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:21,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:21,552 INFO L85 PathProgramCache]: Analyzing trace with hash -4848888, now seen corresponding path program 1 times [2024-11-08 22:33:21,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:33:21,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368013882] [2024-11-08 22:33:21,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:21,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:21,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:33:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:21,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:33:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:21,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:33:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:21,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:33:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:21,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:33:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:21,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:33:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:21,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:33:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:21,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:33:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:21,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:33:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:21,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:33:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:21,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:33:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:21,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:33:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:21,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:33:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:22,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:33:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:22,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:33:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:22,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:33:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:22,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:33:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:22,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:33:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:22,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:33:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:22,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 22:33:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:22,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:33:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:22,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 22:33:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:22,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:33:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:22,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:33:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:22,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:33:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:33:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:22,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:33:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 22:33:22,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:33:22,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368013882] [2024-11-08 22:33:22,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368013882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:22,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:22,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:33:22,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914637246] [2024-11-08 22:33:22,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:22,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:33:22,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:33:22,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:33:22,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:33:22,159 INFO L87 Difference]: Start difference. First operand has 94 states, 64 states have (on average 1.484375) internal successors, (95), 65 states have internal predecessors, (95), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 22:33:22,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:22,190 INFO L93 Difference]: Finished difference Result 181 states and 319 transitions. [2024-11-08 22:33:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:33:22,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2024-11-08 22:33:22,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:22,203 INFO L225 Difference]: With dead ends: 181 [2024-11-08 22:33:22,204 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 22:33:22,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-08 22:33:22,213 INFO L432 NwaCegarLoop]: 141 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, 141 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-08 22:33:22,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:33:22,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 22:33:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-08 22:33:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 61 states have internal predecessors, (87), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 22:33:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2024-11-08 22:33:22,285 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 174 [2024-11-08 22:33:22,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:22,285 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2024-11-08 22:33:22,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 22:33:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2024-11-08 22:33:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-08 22:33:22,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:22,291 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:33:22,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:33:22,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:22,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:22,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1955211250, now seen corresponding path program 1 times [2024-11-08 22:33:22,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:33:22,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276697717] [2024-11-08 22:33:22,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:22,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:33:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:33:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:33:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:33:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:33:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:33:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:33:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:33:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:33:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:33:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:33:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:33:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:33:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:33:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:33:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:33:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:33:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:33:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:33:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 22:33:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:33:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 22:33:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:33:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:33:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:33:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:33:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:33:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 22:33:23,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:33:23,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276697717] [2024-11-08 22:33:23,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276697717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:23,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:23,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:33:23,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980176312] [2024-11-08 22:33:23,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:23,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:33:23,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:33:23,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:33:23,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:33:23,457 INFO L87 Difference]: Start difference. First operand 90 states and 141 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:33:23,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:23,554 INFO L93 Difference]: Finished difference Result 189 states and 294 transitions. [2024-11-08 22:33:23,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:33:23,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2024-11-08 22:33:23,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:23,560 INFO L225 Difference]: With dead ends: 189 [2024-11-08 22:33:23,560 INFO L226 Difference]: Without dead ends: 102 [2024-11-08 22:33:23,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:33:23,565 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 32 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:23,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 380 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:33:23,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-08 22:33:23,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2024-11-08 22:33:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 65 states have internal predecessors, (93), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 22:33:23,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 147 transitions. [2024-11-08 22:33:23,585 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 147 transitions. Word has length 174 [2024-11-08 22:33:23,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:23,587 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 147 transitions. [2024-11-08 22:33:23,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:33:23,590 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 147 transitions. [2024-11-08 22:33:23,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-08 22:33:23,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:23,597 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:33:23,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:33:23,597 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:23,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:23,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1953364208, now seen corresponding path program 1 times [2024-11-08 22:33:23,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:33:23,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110377221] [2024-11-08 22:33:23,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:23,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:33:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:33:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:33:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:33:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:33:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:33:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:33:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:33:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:33:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:33:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:33:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:33:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:33:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:33:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:33:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:33:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:33:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:33:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:33:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 22:33:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:33:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 22:33:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:33:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:33:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:33:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:33:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:33:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 22:33:23,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:33:23,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110377221] [2024-11-08 22:33:23,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110377221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:23,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:23,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:33:23,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696916839] [2024-11-08 22:33:23,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:23,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:33:23,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:33:23,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:33:23,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:24,001 INFO L87 Difference]: Start difference. First operand 94 states and 147 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:33:24,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:24,099 INFO L93 Difference]: Finished difference Result 258 states and 409 transitions. [2024-11-08 22:33:24,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:33:24,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2024-11-08 22:33:24,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:24,102 INFO L225 Difference]: With dead ends: 258 [2024-11-08 22:33:24,105 INFO L226 Difference]: Without dead ends: 167 [2024-11-08 22:33:24,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:24,108 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 70 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:24,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 246 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:33:24,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-08 22:33:24,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 148. [2024-11-08 22:33:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 22:33:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 230 transitions. [2024-11-08 22:33:24,132 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 230 transitions. Word has length 174 [2024-11-08 22:33:24,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:24,133 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 230 transitions. [2024-11-08 22:33:24,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:33:24,134 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 230 transitions. [2024-11-08 22:33:24,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 22:33:24,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:24,136 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:33:24,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:33:24,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:24,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:24,137 INFO L85 PathProgramCache]: Analyzing trace with hash -556648894, now seen corresponding path program 1 times [2024-11-08 22:33:24,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:33:24,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230069154] [2024-11-08 22:33:24,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:24,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:33:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:33:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:33:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:33:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:33:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:33:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:33:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:33:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:33:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:33:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:33:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:33:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:33:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:33:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:33:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:33:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:33:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:33:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:33:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 22:33:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:33:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 22:33:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:33:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:33:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:33:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:33:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:33:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 22:33:24,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:33:24,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230069154] [2024-11-08 22:33:24,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230069154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:24,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:24,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:33:24,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112488667] [2024-11-08 22:33:24,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:24,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:33:24,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:33:24,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:33:24,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:24,776 INFO L87 Difference]: Start difference. First operand 148 states and 230 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:33:24,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:24,855 INFO L93 Difference]: Finished difference Result 270 states and 427 transitions. [2024-11-08 22:33:24,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:33:24,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2024-11-08 22:33:24,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:24,858 INFO L225 Difference]: With dead ends: 270 [2024-11-08 22:33:24,858 INFO L226 Difference]: Without dead ends: 175 [2024-11-08 22:33:24,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:24,864 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 76 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:24,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 269 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:33:24,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-08 22:33:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 148. [2024-11-08 22:33:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 22:33:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 228 transitions. [2024-11-08 22:33:24,907 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 228 transitions. Word has length 175 [2024-11-08 22:33:24,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:24,908 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 228 transitions. [2024-11-08 22:33:24,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:33:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 228 transitions. [2024-11-08 22:33:24,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 22:33:24,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:24,911 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:33:24,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 22:33:24,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:24,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:24,913 INFO L85 PathProgramCache]: Analyzing trace with hash 836560368, now seen corresponding path program 1 times [2024-11-08 22:33:24,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:33:24,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572087279] [2024-11-08 22:33:24,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:24,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:33:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:33:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:33:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:33:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:33:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:33:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:33:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:33:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:33:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:33:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:33:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:33:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:33:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:33:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:33:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:33:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:33:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:33:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:33:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 22:33:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:33:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 22:33:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:33:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:33:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:33:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:33:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:33:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 22:33:25,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:33:25,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572087279] [2024-11-08 22:33:25,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572087279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:25,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:25,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:33:25,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139768802] [2024-11-08 22:33:25,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:25,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:33:25,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:33:25,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:33:25,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:33:25,392 INFO L87 Difference]: Start difference. First operand 148 states and 228 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:33:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:25,635 INFO L93 Difference]: Finished difference Result 277 states and 432 transitions. [2024-11-08 22:33:25,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:33:25,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2024-11-08 22:33:25,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:25,638 INFO L225 Difference]: With dead ends: 277 [2024-11-08 22:33:25,638 INFO L226 Difference]: Without dead ends: 186 [2024-11-08 22:33:25,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:33:25,640 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 114 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:25,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 460 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:33:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-08 22:33:25,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 164. [2024-11-08 22:33:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 107 states have internal predecessors, (147), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 22:33:25,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 255 transitions. [2024-11-08 22:33:25,674 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 255 transitions. Word has length 176 [2024-11-08 22:33:25,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:25,674 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 255 transitions. [2024-11-08 22:33:25,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:33:25,675 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 255 transitions. [2024-11-08 22:33:25,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 22:33:25,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:25,677 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:33:25,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 22:33:25,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:25,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:25,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1574215627, now seen corresponding path program 1 times [2024-11-08 22:33:25,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:33:25,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723971184] [2024-11-08 22:33:25,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:25,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:33:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:33:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:33:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:33:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:33:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:33:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:33:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:33:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:33:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:33:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:33:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:33:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:33:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:33:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:33:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:33:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:33:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:33:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:33:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 22:33:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:33:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 22:33:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 22:33:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:33:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:33:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:33:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:33:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-08 22:33:26,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:33:26,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723971184] [2024-11-08 22:33:26,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723971184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:33:26,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51379382] [2024-11-08 22:33:26,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:26,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:33:26,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:33:26,280 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-08 22:33:26,282 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-08 22:33:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:26,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 22:33:26,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:33:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-11-08 22:33:27,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:33:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-08 22:33:27,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51379382] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:33:27,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 22:33:27,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2024-11-08 22:33:27,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388901543] [2024-11-08 22:33:27,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 22:33:27,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 22:33:27,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:33:27,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 22:33:27,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 22:33:27,787 INFO L87 Difference]: Start difference. First operand 164 states and 255 transitions. Second operand has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2024-11-08 22:33:28,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:28,103 INFO L93 Difference]: Finished difference Result 279 states and 428 transitions. [2024-11-08 22:33:28,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 22:33:28,104 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) Word has length 177 [2024-11-08 22:33:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:28,108 INFO L225 Difference]: With dead ends: 279 [2024-11-08 22:33:28,108 INFO L226 Difference]: Without dead ends: 176 [2024-11-08 22:33:28,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2024-11-08 22:33:28,110 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 113 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:28,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 323 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:33:28,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-08 22:33:28,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 168. [2024-11-08 22:33:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 109 states have (on average 1.2935779816513762) internal successors, (141), 109 states have internal predecessors, (141), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 22:33:28,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2024-11-08 22:33:28,143 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 177 [2024-11-08 22:33:28,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:28,144 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2024-11-08 22:33:28,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2024-11-08 22:33:28,144 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2024-11-08 22:33:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 22:33:28,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:28,146 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:33:28,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 22:33:28,347 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,SelfDestructingSolverStorable5 [2024-11-08 22:33:28,348 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:28,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:28,348 INFO L85 PathProgramCache]: Analyzing trace with hash -2063635543, now seen corresponding path program 1 times [2024-11-08 22:33:28,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:33:28,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311734637] [2024-11-08 22:33:28,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:28,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:33:28,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:33:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:33:28,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:33:28,833 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:33:28,834 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:33:28,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 22:33:28,840 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:33:29,004 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:33:29,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:33:29 BoogieIcfgContainer [2024-11-08 22:33:29,008 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:33:29,009 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:33:29,009 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:33:29,009 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:33:29,010 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:33:21" (3/4) ... [2024-11-08 22:33:29,012 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:33:29,013 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:33:29,014 INFO L158 Benchmark]: Toolchain (without parser) took 8814.82ms. Allocated memory was 155.2MB in the beginning and 323.0MB in the end (delta: 167.8MB). Free memory was 98.0MB in the beginning and 266.9MB in the end (delta: -168.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:33:29,014 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:33:29,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.15ms. Allocated memory is still 155.2MB. Free memory was 98.0MB in the beginning and 81.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 22:33:29,015 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.67ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 78.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 22:33:29,015 INFO L158 Benchmark]: Boogie Preprocessor took 69.63ms. Allocated memory is still 155.2MB. Free memory was 78.4MB in the beginning and 75.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:33:29,015 INFO L158 Benchmark]: RCFGBuilder took 699.01ms. Allocated memory is still 155.2MB. Free memory was 75.0MB in the beginning and 107.5MB in the end (delta: -32.5MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-11-08 22:33:29,016 INFO L158 Benchmark]: TraceAbstraction took 7574.55ms. Allocated memory was 155.2MB in the beginning and 323.0MB in the end (delta: 167.8MB). Free memory was 106.7MB in the beginning and 266.9MB in the end (delta: -160.2MB). Peak memory consumption was 141.9MB. Max. memory is 16.1GB. [2024-11-08 22:33:29,016 INFO L158 Benchmark]: Witness Printer took 4.99ms. Allocated memory is still 323.0MB. Free memory is still 266.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:33:29,018 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.20ms. Allocated memory is still 155.2MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.15ms. Allocated memory is still 155.2MB. Free memory was 98.0MB in the beginning and 81.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.67ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 78.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.63ms. Allocated memory is still 155.2MB. Free memory was 78.4MB in the beginning and 75.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 699.01ms. Allocated memory is still 155.2MB. Free memory was 75.0MB in the beginning and 107.5MB in the end (delta: -32.5MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7574.55ms. Allocated memory was 155.2MB in the beginning and 323.0MB in the end (delta: 167.8MB). Free memory was 106.7MB in the beginning and 266.9MB in the end (delta: -160.2MB). Peak memory consumption was 141.9MB. Max. memory is 16.1GB. * Witness Printer took 4.99ms. Allocated memory is still 323.0MB. Free memory is still 266.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of shiftRight at line 65, overapproximation of someUnaryDOUBLEoperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 191, overapproximation of someBinaryArithmeticFLOAToperation at line 73. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed char var_1_7 = 0; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 4; [L29] unsigned long int var_1_10 = 128; [L30] unsigned long int var_1_11 = 1422462314; [L31] signed short int var_1_12 = 8; [L32] signed short int var_1_15 = -50; [L33] unsigned long int var_1_16 = 1; [L34] unsigned long int var_1_17 = 3609236770; [L35] unsigned long int var_1_18 = 2902762324; [L36] double var_1_19 = 3.8; [L37] double var_1_20 = 255.75; [L38] unsigned short int var_1_21 = 0; [L39] signed char var_1_22 = -8; [L40] signed long int var_1_23 = -32; [L41] unsigned char var_1_25 = 10; [L42] unsigned char var_1_27 = 128; [L43] unsigned char var_1_28 = 100; [L44] float var_1_30 = 31.3; [L45] float var_1_31 = 1.5; [L46] float var_1_32 = 15.25; [L47] double var_1_33 = 128.8; [L48] signed char var_1_34 = 4; [L49] signed char var_1_35 = 1; [L50] unsigned char var_1_36 = 16; [L51] unsigned long int last_1_var_1_10 = 128; [L52] unsigned long int last_1_var_1_16 = 1; [L53] double last_1_var_1_19 = 3.8; VAL [isInitial=0, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=0, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L195] isInitial = 1 [L196] FCALL initially() [L197] COND TRUE 1 [L198] CALL updateLastVariables() [L186] last_1_var_1_10 = var_1_10 [L187] last_1_var_1_16 = var_1_16 [L188] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=0, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L198] RET updateLastVariables() [L199] CALL updateVariables() [L142] var_1_2 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L143] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L144] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L144] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L145] var_1_3 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L146] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L147] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L147] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L148] var_1_7 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L149] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L150] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L150] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L151] var_1_8 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L152] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L153] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L153] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L154] var_1_9 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L155] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L156] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L156] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L157] var_1_11 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L158] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L159] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L160] var_1_17 = __VERIFIER_nondet_ulong() [L161] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L161] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L162] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L162] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L163] var_1_18 = __VERIFIER_nondet_ulong() [L164] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L164] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L165] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L165] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L166] var_1_20 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L167] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L168] var_1_27 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L169] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L170] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L170] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=100, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L171] var_1_28 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L172] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L173] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L173] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L174] var_1_31 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L175] RET assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L176] var_1_32 = __VERIFIER_nondet_float() [L177] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L177] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L178] var_1_34 = __VERIFIER_nondet_char() [L179] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L179] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L180] CALL assume_abort_if_not(var_1_34 <= 5) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L180] RET assume_abort_if_not(var_1_34 <= 5) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L181] var_1_35 = __VERIFIER_nondet_char() [L182] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L182] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L183] CALL assume_abort_if_not(var_1_35 <= 4) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L183] RET assume_abort_if_not(var_1_35 <= 4) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L199] RET updateVariables() [L200] CALL step() [L57] var_1_22 = ((((-25) < 0 ) ? -(-25) : (-25))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L58] COND TRUE var_1_12 > var_1_16 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L59] COND TRUE (~ var_1_12) <= 128 [L60] var_1_23 = var_1_16 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L65] EXPR var_1_4 >> var_1_15 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L65] EXPR ((var_1_10) < ((var_1_4 >> var_1_15))) ? (var_1_10) : ((var_1_4 >> var_1_15)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=10, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L65] COND TRUE var_1_4 <= ((((var_1_10) < ((var_1_4 >> var_1_15))) ? (var_1_10) : ((var_1_4 >> var_1_15)))) [L66] var_1_25 = (var_1_27 - var_1_28) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=0, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L72] COND TRUE \read(var_1_1) [L73] var_1_30 = ((((var_1_31) < ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32)))))) ? (var_1_31) : ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))))))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=0, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=13835058057429647364, var_1_31=13835058057429647364, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L75] COND FALSE !(var_1_16 >= var_1_4) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=0, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=13835058057429647364, var_1_31=13835058057429647364, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L88] COND FALSE !(var_1_27 >= (var_1_28 + var_1_4)) [L97] var_1_36 = var_1_28 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=0, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=13835058057429647364, var_1_31=13835058057429647364, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=127, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L99] unsigned long int stepLocal_1 = last_1_var_1_16; [L100] unsigned long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=0, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=13835058057429647364, var_1_31=13835058057429647364, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=127, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L101] COND TRUE stepLocal_1 != last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=0, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=13835058057429647364, var_1_31=13835058057429647364, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=127, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L102] COND FALSE !(var_1_8 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=0, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=13835058057429647364, var_1_31=13835058057429647364, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=127, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L110] COND TRUE var_1_12 == var_1_12 [L111] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=0, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=13835058057429647364, var_1_31=13835058057429647364, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L113] var_1_1 = (var_1_2 || (! var_1_3)) [L114] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L115] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=7248252282, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=0, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=13835058057429647364, var_1_31=13835058057429647364, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L116] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=7248252282, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=0, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=13835058057429647364, var_1_31=13835058057429647364, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L117] COND FALSE !(var_1_19 >= var_1_19) [L122] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=7248252282, var_1_11=-3221225473, var_1_12=8, var_1_15=0, var_1_16=1, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=0, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=13835058057429647364, var_1_31=13835058057429647364, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L127] COND TRUE var_1_19 != var_1_19 [L128] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=7248252282, var_1_11=-3221225473, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=0, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=13835058057429647364, var_1_31=13835058057429647364, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L136] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_2=1, var_1_10=7248252282, var_1_11=-3221225473, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=0, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=13835058057429647364, var_1_31=13835058057429647364, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L137] COND TRUE (var_1_16 == (var_1_8 - var_1_9)) && stepLocal_2 [L138] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=7248252282, var_1_11=-3221225473, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=0, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=13835058057429647364, var_1_31=13835058057429647364, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L200] RET step() [L201] CALL, EXPR property() [L191-L192] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_12 == var_1_12) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((last_1_var_1_16 != last_1_var_1_10) ? ((var_1_8 <= last_1_var_1_16) ? (((- last_1_var_1_19) >= last_1_var_1_19) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_1 ? ((var_1_19 >= var_1_19) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_19 != var_1_19) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_4 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_16 == (var_1_8 - var_1_9)) && var_1_1) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=7248252282, var_1_11=-3221225473, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=0, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=13835058057429647364, var_1_31=13835058057429647364, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L201] RET, EXPR property() [L201] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=7248252282, var_1_11=-3221225473, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=0, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=13835058057429647364, var_1_31=13835058057429647364, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=7248252282, var_1_11=-3221225473, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=13835058057429647359U, var_1_18=13835058057429647359U, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=1, var_1_25=0, var_1_27=127, var_1_28=127, var_1_2=1, var_1_30=13835058057429647364, var_1_31=13835058057429647364, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 7, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 407 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 405 mSDsluCounter, 1819 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1035 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 424 IncrementalHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 784 mSDtfsCounter, 424 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 708 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=6, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 84 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1405 NumberOfCodeBlocks, 1405 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1396 ConstructedInterpolants, 0 QuantifiedInterpolants, 4639 SizeOfPredicates, 4 NumberOfNonLiveVariables, 418 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 11025/11232 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-08 22:33:29,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-ps-co_file-11.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 6d1e5e5cc6398246832802a812900af1b138e1125bfe18c91f7c567300bec7d3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:33:31,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:33:31,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:33:31,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:33:31,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:33:31,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:33:31,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:33:31,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:33:31,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:33:31,496 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:33:31,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:33:31,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:33:31,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:33:31,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:33:31,501 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:33:31,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:33:31,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:33:31,502 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:33:31,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:33:31,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:33:31,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:33:31,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:33:31,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:33:31,507 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:33:31,507 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:33:31,507 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:33:31,507 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:33:31,507 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:33:31,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:33:31,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:33:31,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:33:31,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:33:31,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:33:31,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:33:31,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:33:31,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:33:31,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:33:31,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:33:31,511 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:33:31,512 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:33:31,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:33:31,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:33:31,513 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:33:31,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:33:31,513 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 -> 6d1e5e5cc6398246832802a812900af1b138e1125bfe18c91f7c567300bec7d3 [2024-11-08 22:33:31,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:33:31,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:33:31,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:33:31,925 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:33:31,926 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:33:31,927 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-ps-co_file-11.i [2024-11-08 22:33:33,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:33:33,801 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:33:33,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-11.i [2024-11-08 22:33:33,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4953d5946/67cc69d093764de2a2189a89d05697c8/FLAG3caabcbbf [2024-11-08 22:33:34,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4953d5946/67cc69d093764de2a2189a89d05697c8 [2024-11-08 22:33:34,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:33:34,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:33:34,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:33:34,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:33:34,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:33:34,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:33:34" (1/1) ... [2024-11-08 22:33:34,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3d20bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:34, skipping insertion in model container [2024-11-08 22:33:34,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:33:34" (1/1) ... [2024-11-08 22:33:34,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:33:34,409 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-ps-co_file-11.i[919,932] [2024-11-08 22:33:34,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:33:34,516 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:33:34,529 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-ps-co_file-11.i[919,932] [2024-11-08 22:33:34,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:33:34,602 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:33:34,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:34 WrapperNode [2024-11-08 22:33:34,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:33:34,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:33:34,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:33:34,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:33:34,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:34" (1/1) ... [2024-11-08 22:33:34,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:34" (1/1) ... [2024-11-08 22:33:34,682 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-11-08 22:33:34,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:33:34,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:33:34,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:33:34,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:33:34,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:34" (1/1) ... [2024-11-08 22:33:34,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:34" (1/1) ... [2024-11-08 22:33:34,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:34" (1/1) ... [2024-11-08 22:33:34,737 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-08 22:33:34,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:34" (1/1) ... [2024-11-08 22:33:34,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:34" (1/1) ... [2024-11-08 22:33:34,756 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:34" (1/1) ... [2024-11-08 22:33:34,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:34" (1/1) ... [2024-11-08 22:33:34,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:34" (1/1) ... [2024-11-08 22:33:34,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:34" (1/1) ... [2024-11-08 22:33:34,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:33:34,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:33:34,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:33:34,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:33:34,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:34" (1/1) ... [2024-11-08 22:33:34,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:33:34,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:33:34,825 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-08 22:33:34,831 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-08 22:33:34,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:33:34,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:33:34,877 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:33:34,877 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:33:34,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:33:34,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:33:34,976 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:33:34,979 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:33:38,199 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 22:33:38,199 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:33:38,216 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:33:38,216 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:33:38,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:33:38 BoogieIcfgContainer [2024-11-08 22:33:38,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:33:38,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:33:38,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:33:38,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:33:38,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:33:34" (1/3) ... [2024-11-08 22:33:38,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40921585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:33:38, skipping insertion in model container [2024-11-08 22:33:38,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:33:34" (2/3) ... [2024-11-08 22:33:38,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40921585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:33:38, skipping insertion in model container [2024-11-08 22:33:38,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:33:38" (3/3) ... [2024-11-08 22:33:38,226 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-11.i [2024-11-08 22:33:38,242 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:33:38,242 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:33:38,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:33:38,329 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;@1cb9dda9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:33:38,330 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:33:38,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 22:33:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 22:33:38,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:38,351 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:33:38,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:38,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:38,357 INFO L85 PathProgramCache]: Analyzing trace with hash 356509357, now seen corresponding path program 1 times [2024-11-08 22:33:38,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:33:38,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568842717] [2024-11-08 22:33:38,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:38,377 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-08 22:33:38,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:33:38,380 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-08 22:33:38,383 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-08 22:33:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:38,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:33:38,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:33:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-08 22:33:38,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:33:38,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:33:38,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568842717] [2024-11-08 22:33:38,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568842717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:38,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:38,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:33:38,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314356154] [2024-11-08 22:33:38,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:38,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:33:38,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:33:38,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:33:38,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:33:38,787 INFO L87 Difference]: Start difference. First operand has 86 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) 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, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 22:33:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:38,819 INFO L93 Difference]: Finished difference Result 165 states and 295 transitions. [2024-11-08 22:33:38,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:33:38,821 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, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 172 [2024-11-08 22:33:38,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:38,828 INFO L225 Difference]: With dead ends: 165 [2024-11-08 22:33:38,828 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 22:33:38,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 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-08 22:33:38,835 INFO L432 NwaCegarLoop]: 129 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, 129 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-08 22:33:38,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:33:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 22:33:38,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-08 22:33:38,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 22:33:38,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2024-11-08 22:33:38,895 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 129 transitions. Word has length 172 [2024-11-08 22:33:38,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:38,896 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 129 transitions. [2024-11-08 22:33:38,897 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, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 22:33:38,897 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 129 transitions. [2024-11-08 22:33:38,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 22:33:38,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:38,901 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:33:38,909 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-08 22:33:39,102 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-08 22:33:39,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:39,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:39,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1830992589, now seen corresponding path program 1 times [2024-11-08 22:33:39,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:33:39,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614692880] [2024-11-08 22:33:39,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:39,115 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-08 22:33:39,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:33:39,119 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-08 22:33:39,120 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-08 22:33:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:39,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 22:33:39,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:33:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 22:33:41,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:33:41,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:33:41,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614692880] [2024-11-08 22:33:41,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614692880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:41,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:41,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:33:41,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290115230] [2024-11-08 22:33:41,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:41,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:33:41,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:33:41,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:33:41,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:41,049 INFO L87 Difference]: Start difference. First operand 82 states and 129 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:33:41,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:41,223 INFO L93 Difference]: Finished difference Result 232 states and 372 transitions. [2024-11-08 22:33:41,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:33:41,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2024-11-08 22:33:41,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:41,230 INFO L225 Difference]: With dead ends: 232 [2024-11-08 22:33:41,231 INFO L226 Difference]: Without dead ends: 153 [2024-11-08 22:33:41,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:41,236 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 36 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:41,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 245 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:33:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-08 22:33:41,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2024-11-08 22:33:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 75 states have internal predecessors, (97), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 22:33:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 205 transitions. [2024-11-08 22:33:41,276 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 205 transitions. Word has length 172 [2024-11-08 22:33:41,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:41,277 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 205 transitions. [2024-11-08 22:33:41,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:33:41,277 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 205 transitions. [2024-11-08 22:33:41,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 22:33:41,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:41,280 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:33:41,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 22:33:41,484 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-08 22:33:41,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:41,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:41,487 INFO L85 PathProgramCache]: Analyzing trace with hash 519123053, now seen corresponding path program 1 times [2024-11-08 22:33:41,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:33:41,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860151057] [2024-11-08 22:33:41,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:41,488 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-08 22:33:41,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:33:41,494 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-08 22:33:41,497 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-08 22:33:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:41,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 22:33:41,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:33:43,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 22:33:43,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:33:43,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:33:43,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860151057] [2024-11-08 22:33:43,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860151057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:43,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:43,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:33:43,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006487786] [2024-11-08 22:33:43,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:43,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:33:43,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:33:43,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:33:43,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:43,304 INFO L87 Difference]: Start difference. First operand 132 states and 205 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:33:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:43,598 INFO L93 Difference]: Finished difference Result 226 states and 359 transitions. [2024-11-08 22:33:43,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:33:43,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2024-11-08 22:33:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:43,606 INFO L225 Difference]: With dead ends: 226 [2024-11-08 22:33:43,607 INFO L226 Difference]: Without dead ends: 147 [2024-11-08 22:33:43,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:43,612 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 26 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:43,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 233 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 22:33:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-08 22:33:43,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 133. [2024-11-08 22:33:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 76 states have internal predecessors, (98), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 22:33:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 206 transitions. [2024-11-08 22:33:43,652 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 206 transitions. Word has length 173 [2024-11-08 22:33:43,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:43,654 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 206 transitions. [2024-11-08 22:33:43,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:33:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 206 transitions. [2024-11-08 22:33:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-08 22:33:43,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:43,661 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:33:43,671 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 (4)] Forceful destruction successful, exit code 0 [2024-11-08 22:33:43,864 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-08 22:33:43,864 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:43,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:43,865 INFO L85 PathProgramCache]: Analyzing trace with hash -600614769, now seen corresponding path program 1 times [2024-11-08 22:33:43,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:33:43,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922666235] [2024-11-08 22:33:43,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:43,866 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-08 22:33:43,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:33:43,873 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-08 22:33:43,874 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-08 22:33:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:44,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 22:33:44,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:33:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 22:33:44,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:33:44,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:33:44,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922666235] [2024-11-08 22:33:44,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922666235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:44,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:44,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:33:44,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912402479] [2024-11-08 22:33:44,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:44,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:33:44,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:33:44,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:33:44,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:44,459 INFO L87 Difference]: Start difference. First operand 133 states and 206 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:33:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:44,663 INFO L93 Difference]: Finished difference Result 227 states and 359 transitions. [2024-11-08 22:33:44,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:33:44,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2024-11-08 22:33:44,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:44,666 INFO L225 Difference]: With dead ends: 227 [2024-11-08 22:33:44,666 INFO L226 Difference]: Without dead ends: 148 [2024-11-08 22:33:44,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:33:44,668 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 24 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:44,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 244 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:33:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-08 22:33:44,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2024-11-08 22:33:44,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 78 states have internal predecessors, (100), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 22:33:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 208 transitions. [2024-11-08 22:33:44,688 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 208 transitions. Word has length 174 [2024-11-08 22:33:44,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:44,689 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 208 transitions. [2024-11-08 22:33:44,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:33:44,690 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 208 transitions. [2024-11-08 22:33:44,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-08 22:33:44,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:44,691 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:33:44,704 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 (5)] Forceful destruction successful, exit code 0 [2024-11-08 22:33:44,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-08 22:33:44,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:44,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:44,893 INFO L85 PathProgramCache]: Analyzing trace with hash 420453585, now seen corresponding path program 1 times [2024-11-08 22:33:44,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:33:44,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633817945] [2024-11-08 22:33:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:44,894 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-08 22:33:44,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:33:44,898 INFO L229 MonitoredProcess]: Starting monitored process 6 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-08 22:33:44,900 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 (6)] Waiting until timeout for monitored process [2024-11-08 22:33:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:45,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 22:33:45,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:33:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 22:33:46,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:33:46,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:33:46,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633817945] [2024-11-08 22:33:46,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633817945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:46,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:46,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:33:46,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70614142] [2024-11-08 22:33:46,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:46,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:33:46,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:33:46,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:33:46,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:33:46,726 INFO L87 Difference]: Start difference. First operand 135 states and 208 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:33:47,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:47,345 INFO L93 Difference]: Finished difference Result 241 states and 377 transitions. [2024-11-08 22:33:47,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:33:47,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2024-11-08 22:33:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:47,352 INFO L225 Difference]: With dead ends: 241 [2024-11-08 22:33:47,352 INFO L226 Difference]: Without dead ends: 162 [2024-11-08 22:33:47,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:33:47,354 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 87 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:47,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 414 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 22:33:47,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-08 22:33:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 144. [2024-11-08 22:33:47,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 22:33:47,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 224 transitions. [2024-11-08 22:33:47,378 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 224 transitions. Word has length 174 [2024-11-08 22:33:47,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:47,380 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 224 transitions. [2024-11-08 22:33:47,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:33:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 224 transitions. [2024-11-08 22:33:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 22:33:47,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:47,383 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:33:47,394 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 (6)] Ended with exit code 0 [2024-11-08 22:33:47,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-08 22:33:47,584 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:47,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:47,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1615218474, now seen corresponding path program 1 times [2024-11-08 22:33:47,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:33:47,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563648594] [2024-11-08 22:33:47,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:47,585 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-08 22:33:47,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:33:47,587 INFO L229 MonitoredProcess]: Starting monitored process 7 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-08 22:33:47,588 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 (7)] Waiting until timeout for monitored process [2024-11-08 22:33:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:47,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 22:33:47,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:33:48,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-11-08 22:33:48,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:33:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-08 22:33:49,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:33:49,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563648594] [2024-11-08 22:33:49,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563648594] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:33:49,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 22:33:49,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-08 22:33:49,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691168383] [2024-11-08 22:33:49,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 22:33:49,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 22:33:49,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:33:49,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 22:33:49,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 22:33:49,058 INFO L87 Difference]: Start difference. First operand 144 states and 224 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-08 22:33:49,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:49,847 INFO L93 Difference]: Finished difference Result 239 states and 364 transitions. [2024-11-08 22:33:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 22:33:49,848 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 175 [2024-11-08 22:33:49,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:49,851 INFO L225 Difference]: With dead ends: 239 [2024-11-08 22:33:49,851 INFO L226 Difference]: Without dead ends: 160 [2024-11-08 22:33:49,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 341 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-08 22:33:49,853 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 121 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:49,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 212 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 22:33:49,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-08 22:33:49,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2024-11-08 22:33:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 93 states have internal predecessors, (118), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 22:33:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 226 transitions. [2024-11-08 22:33:49,878 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 226 transitions. Word has length 175 [2024-11-08 22:33:49,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:49,879 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 226 transitions. [2024-11-08 22:33:49,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-08 22:33:49,879 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 226 transitions. [2024-11-08 22:33:49,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 22:33:49,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:49,881 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:33:49,891 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 (7)] Ended with exit code 0 [2024-11-08 22:33:50,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-08 22:33:50,082 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:50,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:50,083 INFO L85 PathProgramCache]: Analyzing trace with hash -735289012, now seen corresponding path program 1 times [2024-11-08 22:33:50,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:33:50,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870133041] [2024-11-08 22:33:50,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:50,084 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-08 22:33:50,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:33:50,087 INFO L229 MonitoredProcess]: Starting monitored process 8 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-08 22:33:50,088 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 (8)] Waiting until timeout for monitored process [2024-11-08 22:33:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:50,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 22:33:50,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:33:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 22:33:50,879 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:33:50,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:33:50,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870133041] [2024-11-08 22:33:50,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870133041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:33:50,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:33:50,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:33:50,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004362877] [2024-11-08 22:33:50,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:33:50,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:33:50,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:33:50,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:33:50,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:33:50,882 INFO L87 Difference]: Start difference. First operand 152 states and 226 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:33:53,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:33:54,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:33:57,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:33:57,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:33:57,350 INFO L93 Difference]: Finished difference Result 239 states and 357 transitions. [2024-11-08 22:33:57,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:33:57,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2024-11-08 22:33:57,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:33:57,352 INFO L225 Difference]: With dead ends: 239 [2024-11-08 22:33:57,353 INFO L226 Difference]: Without dead ends: 156 [2024-11-08 22:33:57,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:33:57,354 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 98 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-08 22:33:57,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 280 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-08 22:33:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-08 22:33:57,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2024-11-08 22:33:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 93 states have internal predecessors, (115), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 22:33:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 223 transitions. [2024-11-08 22:33:57,386 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 223 transitions. Word has length 176 [2024-11-08 22:33:57,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:33:57,387 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 223 transitions. [2024-11-08 22:33:57,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:33:57,388 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 223 transitions. [2024-11-08 22:33:57,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 22:33:57,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:33:57,391 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:33:57,402 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 (8)] Forceful destruction successful, exit code 0 [2024-11-08 22:33:57,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-08 22:33:57,593 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:33:57,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:33:57,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1889800469, now seen corresponding path program 1 times [2024-11-08 22:33:57,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:33:57,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888412368] [2024-11-08 22:33:57,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:33:57,594 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-08 22:33:57,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:33:57,595 INFO L229 MonitoredProcess]: Starting monitored process 9 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-08 22:33:57,596 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 (9)] Waiting until timeout for monitored process [2024-11-08 22:33:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:57,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 22:33:57,776 INFO L278 TraceCheckSpWp]: Computing forward predicates...