./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.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 67b4385bfa6e31a60d16ae9820cda3bada637e495c6490466afc71d2ba1f1751 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:07:06,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:07:06,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 04:07:06,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:07:06,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:07:06,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:07:06,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:07:06,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:07:06,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:07:06,148 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:07:06,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:07:06,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:07:06,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:07:06,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:07:06,149 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:07:06,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:07:06,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:07:06,150 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:07:06,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 04:07:06,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:07:06,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:07:06,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:07:06,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:07:06,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:07:06,153 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:07:06,154 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:07:06,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:07:06,154 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:07:06,154 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:07:06,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:07:06,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:07:06,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:07:06,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:07:06,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:07:06,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:07:06,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:07:06,155 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 04:07:06,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 04:07:06,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:07:06,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:07:06,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:07:06,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:07:06,158 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 -> 67b4385bfa6e31a60d16ae9820cda3bada637e495c6490466afc71d2ba1f1751 [2024-11-20 04:07:06,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:07:06,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:07:06,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:07:06,408 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:07:06,408 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:07:06,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i [2024-11-20 04:07:07,769 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:07:07,988 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:07:07,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i [2024-11-20 04:07:08,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2be3a747b/c774b956e7db4b4e9e7619862c21fc5f/FLAGec5263f19 [2024-11-20 04:07:08,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2be3a747b/c774b956e7db4b4e9e7619862c21fc5f [2024-11-20 04:07:08,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:07:08,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:07:08,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:07:08,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:07:08,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:07:08,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:07:08" (1/1) ... [2024-11-20 04:07:08,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191ab5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:08, skipping insertion in model container [2024-11-20 04:07:08,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:07:08" (1/1) ... [2024-11-20 04:07:08,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:07:08,521 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-pe-ci_file-78.i[919,932] [2024-11-20 04:07:08,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:07:08,669 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:07:08,695 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-pe-ci_file-78.i[919,932] [2024-11-20 04:07:08,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:07:08,794 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:07:08,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:08 WrapperNode [2024-11-20 04:07:08,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:07:08,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:07:08,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:07:08,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:07:08,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:08" (1/1) ... [2024-11-20 04:07:08,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:08" (1/1) ... [2024-11-20 04:07:08,915 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 273 [2024-11-20 04:07:08,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:07:08,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:07:08,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:07:08,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:07:08,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:08" (1/1) ... [2024-11-20 04:07:08,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:08" (1/1) ... [2024-11-20 04:07:08,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:08" (1/1) ... [2024-11-20 04:07:09,035 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-20 04:07:09,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:08" (1/1) ... [2024-11-20 04:07:09,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:08" (1/1) ... [2024-11-20 04:07:09,077 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:08" (1/1) ... [2024-11-20 04:07:09,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:08" (1/1) ... [2024-11-20 04:07:09,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:08" (1/1) ... [2024-11-20 04:07:09,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:08" (1/1) ... [2024-11-20 04:07:09,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:07:09,095 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:07:09,096 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:07:09,096 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:07:09,097 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:08" (1/1) ... [2024-11-20 04:07:09,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:07:09,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:07:09,134 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-20 04:07:09,142 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-20 04:07:09,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:07:09,182 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:07:09,182 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:07:09,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 04:07:09,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:07:09,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:07:09,254 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:07:09,258 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:07:09,724 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-20 04:07:09,724 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:07:09,740 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:07:09,742 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:07:09,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:07:09 BoogieIcfgContainer [2024-11-20 04:07:09,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:07:09,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:07:09,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:07:09,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:07:09,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:07:08" (1/3) ... [2024-11-20 04:07:09,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20934b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:07:09, skipping insertion in model container [2024-11-20 04:07:09,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:08" (2/3) ... [2024-11-20 04:07:09,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20934b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:07:09, skipping insertion in model container [2024-11-20 04:07:09,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:07:09" (3/3) ... [2024-11-20 04:07:09,752 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i [2024-11-20 04:07:09,767 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:07:09,767 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:07:09,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:07:09,844 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;@560da593, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:07:09,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:07:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 82 states have (on average 1.475609756097561) internal successors, (121), 83 states have internal predecessors, (121), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 04:07:09,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-20 04:07:09,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:07:09,865 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:09,865 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:07:09,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:07:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash 779857267, now seen corresponding path program 1 times [2024-11-20 04:07:09,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:07:09,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691510344] [2024-11-20 04:07:09,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:09,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:07:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:07:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:07:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:07:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:07:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:07:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:07:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:07:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:07:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:07:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:07:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:07:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:07:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 04:07:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:07:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 04:07:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:07:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 04:07:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:07:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 04:07:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:07:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:07:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:07:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:07:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:07:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:07:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:07:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 04:07:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:07:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 04:07:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:07:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 04:07:10,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:07:10,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691510344] [2024-11-20 04:07:10,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691510344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:07:10,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:07:10,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:07:10,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358314754] [2024-11-20 04:07:10,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:07:10,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:07:10,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:07:10,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:07:10,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:07:10,381 INFO L87 Difference]: Start difference. First operand has 115 states, 82 states have (on average 1.475609756097561) internal successors, (121), 83 states have internal predecessors, (121), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-20 04:07:10,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:07:10,409 INFO L93 Difference]: Finished difference Result 223 states and 386 transitions. [2024-11-20 04:07:10,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:07:10,412 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 198 [2024-11-20 04:07:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:07:10,419 INFO L225 Difference]: With dead ends: 223 [2024-11-20 04:07:10,420 INFO L226 Difference]: Without dead ends: 111 [2024-11-20 04:07:10,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-20 04:07:10,430 INFO L432 NwaCegarLoop]: 174 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, 174 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-20 04:07:10,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:07:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-20 04:07:10,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-20 04:07:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 79 states have internal predecessors, (114), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 04:07:10,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 174 transitions. [2024-11-20 04:07:10,480 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 174 transitions. Word has length 198 [2024-11-20 04:07:10,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:07:10,481 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 174 transitions. [2024-11-20 04:07:10,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-20 04:07:10,481 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 174 transitions. [2024-11-20 04:07:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-20 04:07:10,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:07:10,485 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:10,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 04:07:10,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:07:10,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:07:10,486 INFO L85 PathProgramCache]: Analyzing trace with hash -470576001, now seen corresponding path program 1 times [2024-11-20 04:07:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:07:10,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264492087] [2024-11-20 04:07:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:10,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:07:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:07:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:07:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:07:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:07:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:07:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:07:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:07:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:07:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:07:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:07:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:07:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:07:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 04:07:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:07:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 04:07:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:07:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 04:07:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:07:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 04:07:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:07:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:07:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:07:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:07:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:07:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:07:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:07:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 04:07:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:07:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 04:07:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:07:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 04:07:10,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:07:10,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264492087] [2024-11-20 04:07:10,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264492087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:07:10,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:07:10,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:07:10,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104347100] [2024-11-20 04:07:10,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:07:10,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:07:10,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:07:10,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:07:10,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:07:10,788 INFO L87 Difference]: Start difference. First operand 111 states and 174 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:07:10,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:07:10,828 INFO L93 Difference]: Finished difference Result 219 states and 345 transitions. [2024-11-20 04:07:10,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:07:10,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2024-11-20 04:07:10,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:07:10,831 INFO L225 Difference]: With dead ends: 219 [2024-11-20 04:07:10,831 INFO L226 Difference]: Without dead ends: 111 [2024-11-20 04:07:10,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:07:10,834 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:07:10,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:07:10,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-20 04:07:10,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-20 04:07:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 79 states have internal predecessors, (113), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 04:07:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 173 transitions. [2024-11-20 04:07:10,868 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 173 transitions. Word has length 198 [2024-11-20 04:07:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:07:10,872 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 173 transitions. [2024-11-20 04:07:10,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:07:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 173 transitions. [2024-11-20 04:07:10,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-20 04:07:10,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:07:10,879 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:10,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 04:07:10,880 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:07:10,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:07:10,880 INFO L85 PathProgramCache]: Analyzing trace with hash 721656698, now seen corresponding path program 1 times [2024-11-20 04:07:10,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:07:10,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040214809] [2024-11-20 04:07:10,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:10,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:07:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:07:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:07:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:07:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:07:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:07:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:07:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:07:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:07:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:07:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:07:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:07:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:07:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 04:07:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:07:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 04:07:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:07:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 04:07:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:07:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 04:07:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:07:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:07:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:07:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:07:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:07:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:07:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:07:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 04:07:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:07:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 04:07:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:07:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 04:07:11,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:07:11,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040214809] [2024-11-20 04:07:11,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040214809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:07:11,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:07:11,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:07:11,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001125476] [2024-11-20 04:07:11,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:07:11,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:07:11,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:07:11,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:07:11,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:07:11,391 INFO L87 Difference]: Start difference. First operand 111 states and 173 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:07:11,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:07:11,594 INFO L93 Difference]: Finished difference Result 328 states and 514 transitions. [2024-11-20 04:07:11,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:07:11,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 199 [2024-11-20 04:07:11,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:07:11,599 INFO L225 Difference]: With dead ends: 328 [2024-11-20 04:07:11,602 INFO L226 Difference]: Without dead ends: 220 [2024-11-20 04:07:11,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:07:11,604 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 124 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:07:11,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 474 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 04:07:11,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-20 04:07:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 203. [2024-11-20 04:07:11,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 140 states have (on average 1.4285714285714286) internal successors, (200), 140 states have internal predecessors, (200), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 04:07:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 320 transitions. [2024-11-20 04:07:11,649 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 320 transitions. Word has length 199 [2024-11-20 04:07:11,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:07:11,650 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 320 transitions. [2024-11-20 04:07:11,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:07:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 320 transitions. [2024-11-20 04:07:11,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-20 04:07:11,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:07:11,656 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:11,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 04:07:11,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:07:11,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:07:11,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1390613235, now seen corresponding path program 1 times [2024-11-20 04:07:11,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:07:11,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036080054] [2024-11-20 04:07:11,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:11,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:07:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:07:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:07:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:07:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:07:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:07:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:07:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:07:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:07:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:07:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:07:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:07:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:07:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 04:07:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:07:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 04:07:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:07:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 04:07:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:07:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 04:07:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:07:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:07:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:07:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:07:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:07:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:07:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:07:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 04:07:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:07:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 04:07:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:07:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 04:07:11,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:07:11,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036080054] [2024-11-20 04:07:11,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036080054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:07:11,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:07:11,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:07:11,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993297412] [2024-11-20 04:07:11,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:07:11,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:07:11,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:07:11,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:07:11,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:07:11,961 INFO L87 Difference]: Start difference. First operand 203 states and 320 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:07:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:07:12,119 INFO L93 Difference]: Finished difference Result 514 states and 816 transitions. [2024-11-20 04:07:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:07:12,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 200 [2024-11-20 04:07:12,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:07:12,122 INFO L225 Difference]: With dead ends: 514 [2024-11-20 04:07:12,122 INFO L226 Difference]: Without dead ends: 372 [2024-11-20 04:07:12,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:07:12,124 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 196 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:07:12,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 537 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:07:12,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-20 04:07:12,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 354. [2024-11-20 04:07:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 260 states have (on average 1.476923076923077) internal successors, (384), 260 states have internal predecessors, (384), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-20 04:07:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 564 transitions. [2024-11-20 04:07:12,155 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 564 transitions. Word has length 200 [2024-11-20 04:07:12,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:07:12,156 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 564 transitions. [2024-11-20 04:07:12,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:07:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 564 transitions. [2024-11-20 04:07:12,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-20 04:07:12,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:07:12,158 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:12,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 04:07:12,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:07:12,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:07:12,159 INFO L85 PathProgramCache]: Analyzing trace with hash 2003594613, now seen corresponding path program 1 times [2024-11-20 04:07:12,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:07:12,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133634134] [2024-11-20 04:07:12,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:12,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:07:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:07:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:07:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:07:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:07:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:07:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:07:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:07:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:07:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:07:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:07:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:07:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:07:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 04:07:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:07:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 04:07:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:07:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 04:07:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:07:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 04:07:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:07:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:07:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:07:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:07:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:07:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:07:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:07:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 04:07:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:07:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 04:07:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:07:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 04:07:12,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:07:12,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133634134] [2024-11-20 04:07:12,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133634134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:07:12,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:07:12,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:07:12,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585189367] [2024-11-20 04:07:12,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:07:12,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:07:12,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:07:12,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:07:12,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:07:12,520 INFO L87 Difference]: Start difference. First operand 354 states and 564 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:07:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:07:12,685 INFO L93 Difference]: Finished difference Result 679 states and 1077 transitions. [2024-11-20 04:07:12,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:07:12,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 201 [2024-11-20 04:07:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:07:12,688 INFO L225 Difference]: With dead ends: 679 [2024-11-20 04:07:12,688 INFO L226 Difference]: Without dead ends: 386 [2024-11-20 04:07:12,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:07:12,689 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 116 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:07:12,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 474 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:07:12,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-20 04:07:12,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2024-11-20 04:07:12,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 264 states have (on average 1.4659090909090908) internal successors, (387), 264 states have internal predecessors, (387), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-20 04:07:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 567 transitions. [2024-11-20 04:07:12,710 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 567 transitions. Word has length 201 [2024-11-20 04:07:12,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:07:12,711 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 567 transitions. [2024-11-20 04:07:12,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:07:12,711 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 567 transitions. [2024-11-20 04:07:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-20 04:07:12,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:07:12,713 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:12,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 04:07:12,713 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:07:12,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:07:12,713 INFO L85 PathProgramCache]: Analyzing trace with hash -57085078, now seen corresponding path program 1 times [2024-11-20 04:07:12,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:07:12,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895253334] [2024-11-20 04:07:12,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:12,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:07:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:07:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:07:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:07:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:07:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:07:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:07:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:07:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:07:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:07:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:07:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:07:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:07:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 04:07:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:07:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 04:07:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:07:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 04:07:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:07:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 04:07:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:07:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:07:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:07:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:07:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:07:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:07:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:07:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 04:07:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:07:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 04:07:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:07:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 04:07:13,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:07:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895253334] [2024-11-20 04:07:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895253334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:07:13,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:07:13,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 04:07:13,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27216810] [2024-11-20 04:07:13,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:07:13,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 04:07:13,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:07:13,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 04:07:13,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:07:13,154 INFO L87 Difference]: Start difference. First operand 358 states and 567 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:07:13,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:07:13,509 INFO L93 Difference]: Finished difference Result 1055 states and 1684 transitions. [2024-11-20 04:07:13,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 04:07:13,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 202 [2024-11-20 04:07:13,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:07:13,516 INFO L225 Difference]: With dead ends: 1055 [2024-11-20 04:07:13,517 INFO L226 Difference]: Without dead ends: 754 [2024-11-20 04:07:13,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-20 04:07:13,519 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 263 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:07:13,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 566 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 04:07:13,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-11-20 04:07:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 635. [2024-11-20 04:07:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 479 states have (on average 1.4718162839248434) internal successors, (705), 479 states have internal predecessors, (705), 150 states have call successors, (150), 5 states have call predecessors, (150), 5 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-20 04:07:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1005 transitions. [2024-11-20 04:07:13,600 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1005 transitions. Word has length 202 [2024-11-20 04:07:13,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:07:13,600 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 1005 transitions. [2024-11-20 04:07:13,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:07:13,601 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1005 transitions. [2024-11-20 04:07:13,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-20 04:07:13,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:07:13,603 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:13,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 04:07:13,603 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:07:13,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:07:13,604 INFO L85 PathProgramCache]: Analyzing trace with hash -34452824, now seen corresponding path program 1 times [2024-11-20 04:07:13,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:07:13,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009768058] [2024-11-20 04:07:13,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:13,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:07:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:07:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:07:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:07:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:07:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:07:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:07:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:07:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:07:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:07:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:07:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:07:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:07:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 04:07:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:07:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 04:07:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:07:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 04:07:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:07:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 04:07:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:07:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:07:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:07:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:07:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:07:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:07:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:07:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 04:07:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:07:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 04:07:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:07:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:13,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 04:07:13,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:07:13,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009768058] [2024-11-20 04:07:13,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009768058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:07:13,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:07:13,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 04:07:13,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039458893] [2024-11-20 04:07:13,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:07:13,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 04:07:13,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:07:13,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 04:07:13,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 04:07:13,899 INFO L87 Difference]: Start difference. First operand 635 states and 1005 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:07:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:07:14,018 INFO L93 Difference]: Finished difference Result 1229 states and 1949 transitions. [2024-11-20 04:07:14,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 04:07:14,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 202 [2024-11-20 04:07:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:07:14,022 INFO L225 Difference]: With dead ends: 1229 [2024-11-20 04:07:14,022 INFO L226 Difference]: Without dead ends: 766 [2024-11-20 04:07:14,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 04:07:14,024 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 123 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:07:14,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 646 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:07:14,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-11-20 04:07:14,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 730. [2024-11-20 04:07:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 574 states have (on average 1.4930313588850175) internal successors, (857), 574 states have internal predecessors, (857), 150 states have call successors, (150), 5 states have call predecessors, (150), 5 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-20 04:07:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1157 transitions. [2024-11-20 04:07:14,073 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1157 transitions. Word has length 202 [2024-11-20 04:07:14,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:07:14,074 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1157 transitions. [2024-11-20 04:07:14,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:07:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1157 transitions. [2024-11-20 04:07:14,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-20 04:07:14,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:07:14,076 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:14,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 04:07:14,076 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:07:14,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:07:14,077 INFO L85 PathProgramCache]: Analyzing trace with hash 338517128, now seen corresponding path program 1 times [2024-11-20 04:07:14,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:07:14,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474680727] [2024-11-20 04:07:14,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:14,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:07:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:07:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:07:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:07:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:07:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:07:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:07:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:07:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:07:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:07:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:07:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:07:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:07:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 04:07:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:07:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 04:07:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:07:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 04:07:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:07:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 04:07:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:07:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:07:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:07:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:07:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:07:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:07:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:07:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 04:07:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:07:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 04:07:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:07:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 04:07:15,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:07:15,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474680727] [2024-11-20 04:07:15,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474680727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:07:15,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:07:15,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 04:07:15,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110567865] [2024-11-20 04:07:15,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:07:15,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 04:07:15,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:07:15,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 04:07:15,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 04:07:15,926 INFO L87 Difference]: Start difference. First operand 730 states and 1157 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-20 04:07:16,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:07:16,773 INFO L93 Difference]: Finished difference Result 1049 states and 1644 transitions. [2024-11-20 04:07:16,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 04:07:16,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 207 [2024-11-20 04:07:16,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:07:16,778 INFO L225 Difference]: With dead ends: 1049 [2024-11-20 04:07:16,778 INFO L226 Difference]: Without dead ends: 792 [2024-11-20 04:07:16,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-20 04:07:16,781 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 581 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 04:07:16,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 436 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 04:07:16,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2024-11-20 04:07:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 744. [2024-11-20 04:07:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 588 states have (on average 1.4948979591836735) internal successors, (879), 588 states have internal predecessors, (879), 150 states have call successors, (150), 5 states have call predecessors, (150), 5 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-20 04:07:16,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1179 transitions. [2024-11-20 04:07:16,853 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1179 transitions. Word has length 207 [2024-11-20 04:07:16,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:07:16,854 INFO L471 AbstractCegarLoop]: Abstraction has 744 states and 1179 transitions. [2024-11-20 04:07:16,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-20 04:07:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1179 transitions. [2024-11-20 04:07:16,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-20 04:07:16,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:07:16,856 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:16,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 04:07:16,857 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:07:16,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:07:16,858 INFO L85 PathProgramCache]: Analyzing trace with hash -672600122, now seen corresponding path program 1 times [2024-11-20 04:07:16,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:07:16,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592484806] [2024-11-20 04:07:16,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:16,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:07:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:07:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:07:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:07:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:07:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:07:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:07:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:07:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:07:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:07:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:07:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:07:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:07:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 04:07:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:07:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 04:07:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:07:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 04:07:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:07:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 04:07:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:07:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:07:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:07:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:07:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:07:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:07:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:07:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 04:07:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:07:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 04:07:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:07:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-20 04:07:17,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:07:17,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592484806] [2024-11-20 04:07:17,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592484806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:07:17,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842449207] [2024-11-20 04:07:17,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:17,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:07:17,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:07:17,091 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-20 04:07:17,091 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-20 04:07:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:17,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 04:07:17,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:07:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 857 proven. 33 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-20 04:07:17,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:07:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-20 04:07:17,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842449207] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:07:17,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:07:17,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-20 04:07:17,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188850376] [2024-11-20 04:07:17,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:07:17,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 04:07:17,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:07:17,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 04:07:17,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 04:07:17,640 INFO L87 Difference]: Start difference. First operand 744 states and 1179 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2024-11-20 04:07:17,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:07:17,840 INFO L93 Difference]: Finished difference Result 1416 states and 2223 transitions. [2024-11-20 04:07:17,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 04:07:17,841 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) Word has length 207 [2024-11-20 04:07:17,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:07:17,846 INFO L225 Difference]: With dead ends: 1416 [2024-11-20 04:07:17,846 INFO L226 Difference]: Without dead ends: 774 [2024-11-20 04:07:17,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-20 04:07:17,848 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 100 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:07:17,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 323 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:07:17,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-11-20 04:07:17,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 764. [2024-11-20 04:07:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 603 states have (on average 1.3897180762852404) internal successors, (838), 603 states have internal predecessors, (838), 150 states have call successors, (150), 10 states have call predecessors, (150), 10 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-20 04:07:17,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1138 transitions. [2024-11-20 04:07:17,913 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1138 transitions. Word has length 207 [2024-11-20 04:07:17,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:07:17,914 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 1138 transitions. [2024-11-20 04:07:17,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2024-11-20 04:07:17,914 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1138 transitions. [2024-11-20 04:07:17,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-20 04:07:17,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:07:17,916 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:17,927 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-20 04:07:18,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:07:18,118 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:07:18,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:07:18,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1863685830, now seen corresponding path program 1 times [2024-11-20 04:07:18,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:07:18,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261736548] [2024-11-20 04:07:18,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:18,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:07:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:07:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:07:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:07:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:07:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:07:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:07:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:07:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:07:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:07:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:07:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:07:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:07:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 04:07:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:07:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 04:07:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:07:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 04:07:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:07:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 04:07:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:07:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:07:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:07:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:07:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:07:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:07:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:07:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 04:07:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:07:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 04:07:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:07:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 04:07:18,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:07:18,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261736548] [2024-11-20 04:07:18,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261736548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:07:18,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:07:18,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:07:18,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681829359] [2024-11-20 04:07:18,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:07:18,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:07:18,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:07:18,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:07:18,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:07:18,243 INFO L87 Difference]: Start difference. First operand 764 states and 1138 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:07:18,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:07:18,318 INFO L93 Difference]: Finished difference Result 1824 states and 2698 transitions. [2024-11-20 04:07:18,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:07:18,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 210 [2024-11-20 04:07:18,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:07:18,324 INFO L225 Difference]: With dead ends: 1824 [2024-11-20 04:07:18,324 INFO L226 Difference]: Without dead ends: 1186 [2024-11-20 04:07:18,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-20 04:07:18,327 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 103 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:07:18,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 346 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:07:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2024-11-20 04:07:18,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1180. [2024-11-20 04:07:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 930 states have (on average 1.3505376344086022) internal successors, (1256), 934 states have internal predecessors, (1256), 230 states have call successors, (230), 19 states have call predecessors, (230), 19 states have return successors, (230), 226 states have call predecessors, (230), 230 states have call successors, (230) [2024-11-20 04:07:18,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1716 transitions. [2024-11-20 04:07:18,452 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1716 transitions. Word has length 210 [2024-11-20 04:07:18,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:07:18,453 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1716 transitions. [2024-11-20 04:07:18,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:07:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1716 transitions. [2024-11-20 04:07:18,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-20 04:07:18,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:07:18,456 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:18,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 04:07:18,456 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:07:18,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:07:18,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2082540548, now seen corresponding path program 1 times [2024-11-20 04:07:18,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:07:18,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3145776] [2024-11-20 04:07:18,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:18,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:07:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:07:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:07:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:07:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:07:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:07:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:07:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:07:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:07:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:07:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:07:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:07:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:07:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 04:07:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:07:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 04:07:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:07:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 04:07:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:07:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 04:07:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:07:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:07:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:07:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:07:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:07:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:07:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:07:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 04:07:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:07:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 04:07:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:07:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 60 proven. 27 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-20 04:07:18,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:07:18,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3145776] [2024-11-20 04:07:18,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3145776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:07:18,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920930044] [2024-11-20 04:07:18,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:18,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:07:18,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:07:18,745 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:07:18,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 04:07:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:18,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 04:07:18,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:07:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 789 proven. 27 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 04:07:18,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:07:19,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 60 proven. 27 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-20 04:07:19,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920930044] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:07:19,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:07:19,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-20 04:07:19,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731004532] [2024-11-20 04:07:19,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:07:19,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 04:07:19,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:07:19,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 04:07:19,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 04:07:19,133 INFO L87 Difference]: Start difference. First operand 1180 states and 1716 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 3 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2024-11-20 04:07:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:07:19,323 INFO L93 Difference]: Finished difference Result 1886 states and 2716 transitions. [2024-11-20 04:07:19,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 04:07:19,324 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 3 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) Word has length 210 [2024-11-20 04:07:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:07:19,329 INFO L225 Difference]: With dead ends: 1886 [2024-11-20 04:07:19,329 INFO L226 Difference]: Without dead ends: 824 [2024-11-20 04:07:19,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-20 04:07:19,332 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 101 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:07:19,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 311 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:07:19,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-11-20 04:07:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 804. [2024-11-20 04:07:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 633 states have (on average 1.3143759873617693) internal successors, (832), 633 states have internal predecessors, (832), 150 states have call successors, (150), 20 states have call predecessors, (150), 20 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-20 04:07:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1132 transitions. [2024-11-20 04:07:19,382 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1132 transitions. Word has length 210 [2024-11-20 04:07:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:07:19,383 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1132 transitions. [2024-11-20 04:07:19,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 3 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2024-11-20 04:07:19,383 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1132 transitions. [2024-11-20 04:07:19,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-20 04:07:19,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:07:19,385 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:19,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 04:07:19,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-20 04:07:19,590 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:07:19,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:07:19,591 INFO L85 PathProgramCache]: Analyzing trace with hash -412651391, now seen corresponding path program 1 times [2024-11-20 04:07:19,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:07:19,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703122181] [2024-11-20 04:07:19,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:19,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:07:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:07:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:07:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:07:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:07:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:07:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:07:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:07:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:07:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:07:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:07:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:07:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:07:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 04:07:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:07:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 04:07:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:07:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 04:07:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:07:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 04:07:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:07:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 04:07:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:07:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:07:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:07:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:07:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:07:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 04:07:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:07:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 04:07:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:07:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 04:07:19,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:07:19,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703122181] [2024-11-20 04:07:19,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703122181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:07:19,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:07:19,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:07:19,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387151017] [2024-11-20 04:07:19,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:07:19,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:07:19,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:07:19,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:07:19,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:07:19,772 INFO L87 Difference]: Start difference. First operand 804 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:07:19,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:07:19,838 INFO L93 Difference]: Finished difference Result 1484 states and 2103 transitions. [2024-11-20 04:07:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:07:19,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 212 [2024-11-20 04:07:19,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:07:19,843 INFO L225 Difference]: With dead ends: 1484 [2024-11-20 04:07:19,843 INFO L226 Difference]: Without dead ends: 818 [2024-11-20 04:07:19,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 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-20 04:07:19,845 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:07:19,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:07:19,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-11-20 04:07:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2024-11-20 04:07:19,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 647 states have (on average 1.3075734157650696) internal successors, (846), 647 states have internal predecessors, (846), 150 states have call successors, (150), 20 states have call predecessors, (150), 20 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-20 04:07:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1146 transitions. [2024-11-20 04:07:19,894 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1146 transitions. Word has length 212 [2024-11-20 04:07:19,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:07:19,895 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1146 transitions. [2024-11-20 04:07:19,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:07:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1146 transitions. [2024-11-20 04:07:19,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-20 04:07:19,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:07:19,897 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:19,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 04:07:19,897 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:07:19,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:07:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2000999293, now seen corresponding path program 1 times [2024-11-20 04:07:19,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:07:19,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188610785] [2024-11-20 04:07:19,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:19,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:07:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 04:07:19,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [479119141] [2024-11-20 04:07:19,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:19,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:07:19,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:07:19,975 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:07:19,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 04:07:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:07:20,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 04:07:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:07:20,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 04:07:20,354 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 04:07:20,355 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 04:07:20,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 04:07:20,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:07:20,562 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:07:20,688 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 04:07:20,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:07:20 BoogieIcfgContainer [2024-11-20 04:07:20,692 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 04:07:20,692 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 04:07:20,692 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 04:07:20,693 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 04:07:20,693 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:07:09" (3/4) ... [2024-11-20 04:07:20,695 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 04:07:20,695 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 04:07:20,696 INFO L158 Benchmark]: Toolchain (without parser) took 12354.75ms. Allocated memory was 178.3MB in the beginning and 530.6MB in the end (delta: 352.3MB). Free memory was 110.4MB in the beginning and 265.3MB in the end (delta: -155.0MB). Peak memory consumption was 198.6MB. Max. memory is 16.1GB. [2024-11-20 04:07:20,696 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 178.3MB. Free memory was 135.9MB in the beginning and 135.8MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:07:20,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.58ms. Allocated memory is still 178.3MB. Free memory was 110.2MB in the beginning and 91.0MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 04:07:20,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.63ms. Allocated memory is still 178.3MB. Free memory was 91.0MB in the beginning and 82.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-20 04:07:20,697 INFO L158 Benchmark]: Boogie Preprocessor took 178.24ms. Allocated memory is still 178.3MB. Free memory was 82.1MB in the beginning and 137.9MB in the end (delta: -55.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-20 04:07:20,697 INFO L158 Benchmark]: RCFGBuilder took 647.11ms. Allocated memory is still 178.3MB. Free memory was 137.9MB in the beginning and 95.2MB in the end (delta: 42.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-20 04:07:20,697 INFO L158 Benchmark]: TraceAbstraction took 10947.09ms. Allocated memory was 178.3MB in the beginning and 530.6MB in the end (delta: 352.3MB). Free memory was 94.5MB in the beginning and 265.3MB in the end (delta: -170.8MB). Peak memory consumption was 183.9MB. Max. memory is 16.1GB. [2024-11-20 04:07:20,698 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 530.6MB. Free memory is still 265.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:07:20,699 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.17ms. Allocated memory is still 178.3MB. Free memory was 135.9MB in the beginning and 135.8MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.58ms. Allocated memory is still 178.3MB. Free memory was 110.2MB in the beginning and 91.0MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 120.63ms. Allocated memory is still 178.3MB. Free memory was 91.0MB in the beginning and 82.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 178.24ms. Allocated memory is still 178.3MB. Free memory was 82.1MB in the beginning and 137.9MB in the end (delta: -55.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 647.11ms. Allocated memory is still 178.3MB. Free memory was 137.9MB in the beginning and 95.2MB in the end (delta: 42.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10947.09ms. Allocated memory was 178.3MB in the beginning and 530.6MB in the end (delta: 352.3MB). Free memory was 94.5MB in the beginning and 265.3MB in the end (delta: -170.8MB). Peak memory consumption was 183.9MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 530.6MB. Free memory is still 265.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of bitwiseOr at line 183, overapproximation of someBinaryArithmeticDOUBLEoperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char var_1_22 = 2; [L42] unsigned short int var_1_24 = 8; [L43] unsigned short int var_1_26 = 26914; [L44] unsigned short int var_1_27 = 26182; [L45] unsigned char var_1_28 = 5; [L46] unsigned char var_1_29 = 50; [L47] unsigned char var_1_30 = 10; [L48] signed long int var_1_31 = -32; [L49] unsigned char var_1_32 = 0; [L50] unsigned char var_1_33 = 1; [L51] unsigned char var_1_34 = 0; [L52] signed long int var_1_35 = 1000000; [L53] signed long int var_1_36 = 64; [L54] unsigned char last_1_var_1_3 = 64; [L55] unsigned short int last_1_var_1_6 = 10; [L56] unsigned short int last_1_var_1_15 = 5; [L57] unsigned short int last_1_var_1_20 = 50; [L58] unsigned short int last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L187] isInitial = 1 [L188] FCALL initially() [L189] COND TRUE 1 [L190] CALL updateLastVariables() [L176] last_1_var_1_3 = var_1_3 [L177] last_1_var_1_6 = var_1_6 [L178] last_1_var_1_15 = var_1_15 [L179] last_1_var_1_20 = var_1_20 [L180] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L190] RET updateLastVariables() [L191] CALL updateVariables() [L127] var_1_4 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L128] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L129] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L129] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L130] var_1_5 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L131] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L132] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L132] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L133] var_1_9 = __VERIFIER_nondet_long() [L134] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L134] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L135] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L135] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L136] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L136] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L137] var_1_10 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L138] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L139] var_1_11 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L140] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L141] var_1_12 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L142] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L143] var_1_13 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L144] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L145] var_1_14 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L146] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L147] var_1_17 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L148] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L149] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L149] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L150] var_1_18 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L151] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L152] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L152] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L153] var_1_19 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L154] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L155] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L155] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L156] var_1_26 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_26 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L157] RET assume_abort_if_not(var_1_26 >= 16383) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L158] CALL assume_abort_if_not(var_1_26 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L158] RET assume_abort_if_not(var_1_26 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L159] var_1_27 = __VERIFIER_nondet_ushort() [L160] CALL assume_abort_if_not(var_1_27 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L160] RET assume_abort_if_not(var_1_27 >= 16384) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L161] CALL assume_abort_if_not(var_1_27 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L161] RET assume_abort_if_not(var_1_27 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L162] var_1_29 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L163] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L164] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L164] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L165] var_1_30 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L166] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L167] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L167] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L168] var_1_33 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_33 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L169] RET assume_abort_if_not(var_1_33 >= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L170] CALL assume_abort_if_not(var_1_33 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L170] RET assume_abort_if_not(var_1_33 <= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L171] var_1_34 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L172] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L173] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L173] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L191] RET updateVariables() [L192] CALL step() [L62] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L63] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L66] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L66] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L67] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=94, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L68] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=94, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L71] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L75] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=104, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_8=15/8, var_1_9=95] [L76] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L77] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=104, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L83] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L84] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) [L85] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L86] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L86] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L89] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L90] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=187, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L92] var_1_22 = var_1_5 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=187, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=94, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L93] COND TRUE ((((var_1_5) < (var_1_4)) ? (var_1_5) : (var_1_4))) >= var_1_1 [L94] var_1_24 = ((var_1_26 + var_1_27) - var_1_4) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=187, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=94, var_1_24=32675, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L96] COND TRUE var_1_27 > 0 [L97] var_1_28 = (((((((((var_1_29 + var_1_30)) > (var_1_5)) ? ((var_1_29 + var_1_30)) : (var_1_5)))) < (0)) ? ((((((var_1_29 + var_1_30)) > (var_1_5)) ? ((var_1_29 + var_1_30)) : (var_1_5)))) : (0))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=187, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=94, var_1_24=32675, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L99] COND TRUE var_1_26 != 10 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=187, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=94, var_1_24=32675, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L100] COND FALSE !(var_1_26 <= var_1_29) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=187, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=94, var_1_24=32675, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L104] COND TRUE var_1_26 > 100 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=187, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=94, var_1_24=32675, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L105] EXPR ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=187, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=94, var_1_24=32675, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L105] COND FALSE !((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26) > var_1_6) [L108] var_1_32 = var_1_34 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=187, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=94, var_1_24=32675, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L111] var_1_35 = ((((var_1_26) > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) ? (var_1_26) : (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=187, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=94, var_1_24=32675, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L112] COND FALSE !(var_1_29 > var_1_30) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=187, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=94, var_1_24=32675, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L119] COND FALSE !(var_1_21 >= var_1_20) [L122] var_1_36 = var_1_4 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=187, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=94, var_1_24=32675, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=93, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L192] RET step() [L193] CALL, EXPR property() [L183] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=187, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=94, var_1_24=32675, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=93, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L183] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=187, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=94, var_1_24=32675, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=93, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L183] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=187, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=94, var_1_24=32675, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=93, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L183] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=187, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=94, var_1_24=32675, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=93, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L183-L184] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L193] RET, EXPR property() [L193] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=187, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=94, var_1_24=32675, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=93, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=187, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=104, var_1_21=0, var_1_22=94, var_1_24=32675, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=93, var_1_3=64, var_1_4=93, var_1_5=94, var_1_6=10, var_1_9=95] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 13, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1745 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1707 mSDsluCounter, 5117 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3157 mSDsCounter, 480 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 970 IncrementalHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 480 mSolverCounterUnsat, 1960 mSDtfsCounter, 970 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1648 GetRequests, 1600 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1180occurred in iteration=10, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 302 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 3287 NumberOfCodeBlocks, 3287 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3264 ConstructedInterpolants, 0 QuantifiedInterpolants, 15361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 959 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 27660/27840 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-20 04:07:20,727 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.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 67b4385bfa6e31a60d16ae9820cda3bada637e495c6490466afc71d2ba1f1751 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:07:22,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:07:23,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 04:07:23,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:07:23,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:07:23,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:07:23,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:07:23,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:07:23,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:07:23,046 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:07:23,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:07:23,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:07:23,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:07:23,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:07:23,048 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:07:23,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:07:23,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:07:23,051 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:07:23,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:07:23,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:07:23,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:07:23,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:07:23,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:07:23,052 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 04:07:23,052 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 04:07:23,052 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:07:23,052 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 04:07:23,052 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:07:23,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:07:23,052 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:07:23,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:07:23,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:07:23,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:07:23,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:07:23,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:07:23,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:07:23,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:07:23,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:07:23,054 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 04:07:23,054 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 04:07:23,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:07:23,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:07:23,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:07:23,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:07:23,057 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 -> 67b4385bfa6e31a60d16ae9820cda3bada637e495c6490466afc71d2ba1f1751 [2024-11-20 04:07:23,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:07:23,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:07:23,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:07:23,350 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:07:23,351 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:07:23,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i [2024-11-20 04:07:24,845 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:07:25,062 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:07:25,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i [2024-11-20 04:07:25,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53454713b/2650ecb5392a4f66a5bb83d950abc05c/FLAGdcd7e0b9c [2024-11-20 04:07:25,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53454713b/2650ecb5392a4f66a5bb83d950abc05c [2024-11-20 04:07:25,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:07:25,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:07:25,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:07:25,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:07:25,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:07:25,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:07:25" (1/1) ... [2024-11-20 04:07:25,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b528d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:25, skipping insertion in model container [2024-11-20 04:07:25,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:07:25" (1/1) ... [2024-11-20 04:07:25,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:07:25,264 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-pe-ci_file-78.i[919,932] [2024-11-20 04:07:25,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:07:25,368 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:07:25,379 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-pe-ci_file-78.i[919,932] [2024-11-20 04:07:25,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:07:25,463 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:07:25,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:25 WrapperNode [2024-11-20 04:07:25,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:07:25,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:07:25,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:07:25,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:07:25,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:25" (1/1) ... [2024-11-20 04:07:25,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:25" (1/1) ... [2024-11-20 04:07:25,535 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-11-20 04:07:25,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:07:25,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:07:25,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:07:25,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:07:25,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:25" (1/1) ... [2024-11-20 04:07:25,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:25" (1/1) ... [2024-11-20 04:07:25,555 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:25" (1/1) ... [2024-11-20 04:07:25,572 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-20 04:07:25,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:25" (1/1) ... [2024-11-20 04:07:25,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:25" (1/1) ... [2024-11-20 04:07:25,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:25" (1/1) ... [2024-11-20 04:07:25,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:25" (1/1) ... [2024-11-20 04:07:25,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:25" (1/1) ... [2024-11-20 04:07:25,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:25" (1/1) ... [2024-11-20 04:07:25,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:07:25,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:07:25,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:07:25,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:07:25,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:25" (1/1) ... [2024-11-20 04:07:25,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:07:25,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:07:25,642 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-20 04:07:25,647 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-20 04:07:25,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:07:25,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 04:07:25,685 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:07:25,685 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:07:25,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:07:25,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:07:25,770 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:07:25,775 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:07:33,427 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 04:07:33,438 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:07:33,447 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:07:33,447 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:07:33,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:07:33 BoogieIcfgContainer [2024-11-20 04:07:33,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:07:33,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:07:33,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:07:33,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:07:33,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:07:25" (1/3) ... [2024-11-20 04:07:33,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431df612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:07:33, skipping insertion in model container [2024-11-20 04:07:33,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:07:25" (2/3) ... [2024-11-20 04:07:33,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431df612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:07:33, skipping insertion in model container [2024-11-20 04:07:33,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:07:33" (3/3) ... [2024-11-20 04:07:33,454 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-78.i [2024-11-20 04:07:33,465 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:07:33,465 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:07:33,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:07:33,525 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;@52b6f24e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:07:33,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:07:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 04:07:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 04:07:33,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:07:33,546 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:33,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:07:33,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:07:33,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1296196237, now seen corresponding path program 1 times [2024-11-20 04:07:33,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:07:33,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543404327] [2024-11-20 04:07:33,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:33,565 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-20 04:07:33,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:07:33,569 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-20 04:07:33,573 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-20 04:07:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:34,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 04:07:34,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:07:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2024-11-20 04:07:34,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:07:34,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:07:34,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543404327] [2024-11-20 04:07:34,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543404327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:07:34,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:07:34,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:07:34,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550517379] [2024-11-20 04:07:34,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:07:34,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:07:34,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:07:34,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:07:34,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:07:34,077 INFO L87 Difference]: Start difference. First operand has 87 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-20 04:07:34,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:07:34,103 INFO L93 Difference]: Finished difference Result 167 states and 294 transitions. [2024-11-20 04:07:34,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:07:34,105 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 192 [2024-11-20 04:07:34,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:07:34,110 INFO L225 Difference]: With dead ends: 167 [2024-11-20 04:07:34,111 INFO L226 Difference]: Without dead ends: 83 [2024-11-20 04:07:34,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 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-20 04:07:34,116 INFO L432 NwaCegarLoop]: 128 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, 128 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-20 04:07:34,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:07:34,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-20 04:07:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-20 04:07:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 04:07:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 128 transitions. [2024-11-20 04:07:34,166 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 128 transitions. Word has length 192 [2024-11-20 04:07:34,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:07:34,167 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 128 transitions. [2024-11-20 04:07:34,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-20 04:07:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 128 transitions. [2024-11-20 04:07:34,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 04:07:34,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:07:34,170 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:34,184 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-20 04:07:34,371 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-20 04:07:34,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:07:34,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:07:34,373 INFO L85 PathProgramCache]: Analyzing trace with hash -666402151, now seen corresponding path program 1 times [2024-11-20 04:07:34,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:07:34,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308461169] [2024-11-20 04:07:34,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:34,375 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-20 04:07:34,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:07:34,377 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-20 04:07:34,378 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-20 04:07:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:34,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 04:07:34,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:07:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 04:07:37,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:07:37,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:07:37,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308461169] [2024-11-20 04:07:37,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308461169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:07:37,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:07:37,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:07:37,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857650762] [2024-11-20 04:07:37,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:07:37,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 04:07:37,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:07:37,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 04:07:37,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:07:37,368 INFO L87 Difference]: Start difference. First operand 83 states and 128 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:07:42,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:07:45,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:07:48,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:07:53,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:07:54,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:07:59,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:07:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:07:59,149 INFO L93 Difference]: Finished difference Result 267 states and 415 transitions. [2024-11-20 04:07:59,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 04:07:59,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 192 [2024-11-20 04:07:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:07:59,188 INFO L225 Difference]: With dead ends: 267 [2024-11-20 04:07:59,189 INFO L226 Difference]: Without dead ends: 187 [2024-11-20 04:07:59,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 04:07:59,199 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 106 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 61 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2024-11-20 04:07:59,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 466 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 110 Invalid, 3 Unknown, 0 Unchecked, 21.6s Time] [2024-11-20 04:07:59,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-20 04:07:59,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 161. [2024-11-20 04:07:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 98 states have (on average 1.336734693877551) internal successors, (131), 98 states have internal predecessors, (131), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 04:07:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 251 transitions. [2024-11-20 04:07:59,261 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 251 transitions. Word has length 192 [2024-11-20 04:07:59,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:07:59,270 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 251 transitions. [2024-11-20 04:07:59,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:07:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 251 transitions. [2024-11-20 04:07:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 04:07:59,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:07:59,272 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:07:59,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 04:07:59,472 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-20 04:07:59,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:07:59,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:07:59,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1484050601, now seen corresponding path program 1 times [2024-11-20 04:07:59,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:07:59,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116597954] [2024-11-20 04:07:59,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:07:59,477 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-20 04:07:59,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:07:59,480 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-20 04:07:59,481 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-20 04:07:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:07:59,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 04:07:59,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:07:59,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 04:07:59,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:07:59,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:07:59,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116597954] [2024-11-20 04:07:59,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116597954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:07:59,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:07:59,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:07:59,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888470522] [2024-11-20 04:07:59,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:07:59,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:07:59,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:07:59,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:07:59,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:07:59,874 INFO L87 Difference]: Start difference. First operand 161 states and 251 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:08:03,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-20 04:08:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:08:03,968 INFO L93 Difference]: Finished difference Result 241 states and 376 transitions. [2024-11-20 04:08:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:08:04,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 192 [2024-11-20 04:08:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:08:04,011 INFO L225 Difference]: With dead ends: 241 [2024-11-20 04:08:04,011 INFO L226 Difference]: Without dead ends: 161 [2024-11-20 04:08:04,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 190 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-20 04:08:04,013 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:08:04,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-11-20 04:08:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-20 04:08:04,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-20 04:08:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 04:08:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 249 transitions. [2024-11-20 04:08:04,060 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 249 transitions. Word has length 192 [2024-11-20 04:08:04,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:08:04,061 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 249 transitions. [2024-11-20 04:08:04,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:08:04,065 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 249 transitions. [2024-11-20 04:08:04,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-20 04:08:04,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:08:04,071 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:08:04,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-20 04:08:04,272 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-20 04:08:04,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:08:04,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:08:04,273 INFO L85 PathProgramCache]: Analyzing trace with hash 731526357, now seen corresponding path program 1 times [2024-11-20 04:08:04,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:08:04,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745950706] [2024-11-20 04:08:04,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:08:04,275 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-20 04:08:04,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:08:04,278 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-20 04:08:04,280 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-20 04:08:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:08:04,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 04:08:04,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:08:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 04:08:07,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:08:07,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:08:07,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745950706] [2024-11-20 04:08:07,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745950706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:08:07,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:08:07,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:08:07,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371281469] [2024-11-20 04:08:07,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:08:07,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:08:07,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:08:07,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:08:07,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:08:07,088 INFO L87 Difference]: Start difference. First operand 161 states and 249 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:08:11,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:08:13,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:08:18,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:08:21,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:08:21,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:08:21,685 INFO L93 Difference]: Finished difference Result 243 states and 374 transitions. [2024-11-20 04:08:21,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:08:21,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 193 [2024-11-20 04:08:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:08:21,690 INFO L225 Difference]: With dead ends: 243 [2024-11-20 04:08:21,690 INFO L226 Difference]: Without dead ends: 163 [2024-11-20 04:08:21,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 190 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-20 04:08:21,692 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 33 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2024-11-20 04:08:21,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 281 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 1 Unknown, 0 Unchecked, 14.5s Time] [2024-11-20 04:08:21,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-20 04:08:21,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2024-11-20 04:08:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 04:08:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 248 transitions. [2024-11-20 04:08:21,711 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 248 transitions. Word has length 193 [2024-11-20 04:08:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:08:21,711 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 248 transitions. [2024-11-20 04:08:21,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 04:08:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 248 transitions. [2024-11-20 04:08:21,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-20 04:08:21,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:08:21,714 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:08:21,731 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 (5)] Ended with exit code 0 [2024-11-20 04:08:21,915 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-20 04:08:21,916 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:08:21,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:08:21,917 INFO L85 PathProgramCache]: Analyzing trace with hash -279590893, now seen corresponding path program 1 times [2024-11-20 04:08:21,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:08:21,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006670805] [2024-11-20 04:08:21,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:08:21,918 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-20 04:08:21,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:08:21,920 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-20 04:08:21,921 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-20 04:08:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:08:22,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 04:08:22,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:08:23,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 870 proven. 60 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2024-11-20 04:08:23,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:08:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-20 04:08:24,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:08:24,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006670805] [2024-11-20 04:08:24,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006670805] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:08:24,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 04:08:24,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2024-11-20 04:08:24,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474815982] [2024-11-20 04:08:24,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 04:08:24,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 04:08:24,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:08:24,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 04:08:24,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-20 04:08:24,188 INFO L87 Difference]: Start difference. First operand 161 states and 248 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 4 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-20 04:08:25,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:08:25,047 INFO L93 Difference]: Finished difference Result 339 states and 509 transitions. [2024-11-20 04:08:25,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 04:08:25,047 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 4 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 193 [2024-11-20 04:08:25,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:08:25,049 INFO L225 Difference]: With dead ends: 339 [2024-11-20 04:08:25,049 INFO L226 Difference]: Without dead ends: 181 [2024-11-20 04:08:25,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2024-11-20 04:08:25,051 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 102 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 04:08:25,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 199 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 04:08:25,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-20 04:08:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2024-11-20 04:08:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 110 states have (on average 1.2181818181818183) internal successors, (134), 110 states have internal predecessors, (134), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 04:08:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 254 transitions. [2024-11-20 04:08:25,088 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 254 transitions. Word has length 193 [2024-11-20 04:08:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:08:25,090 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 254 transitions. [2024-11-20 04:08:25,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 4 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-20 04:08:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 254 transitions. [2024-11-20 04:08:25,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-20 04:08:25,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:08:25,092 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:08:25,112 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-20 04:08:25,294 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-20 04:08:25,295 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:08:25,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:08:25,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1213407255, now seen corresponding path program 1 times [2024-11-20 04:08:25,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:08:25,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185969943] [2024-11-20 04:08:25,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:08:25,296 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-20 04:08:25,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:08:25,298 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-20 04:08:25,298 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-20 04:08:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:08:26,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-20 04:08:26,287 INFO L278 TraceCheckSpWp]: Computing forward predicates...