./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-ps-co_file-25.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-ps-co_file-25.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 ff8bee30ebc0a54ebfcfd9d99cb415407b7814d567c1f87cff440d6e8ced68ab --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:28:06,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:28:06,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:28:06,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:28:06,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:28:06,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:28:06,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:28:06,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:28:06,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:28:06,190 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:28:06,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:28:06,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:28:06,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:28:06,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:28:06,193 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:28:06,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:28:06,193 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:28:06,194 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:28:06,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:28:06,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:28:06,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:28:06,198 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:28:06,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:28:06,198 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:28:06,198 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:28:06,198 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:28:06,199 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:28:06,199 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:28:06,199 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:28:06,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:28:06,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:28:06,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:28:06,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:28:06,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:28:06,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:28:06,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:28:06,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:28:06,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:28:06,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:28:06,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:28:06,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:28:06,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:28:06,201 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 -> ff8bee30ebc0a54ebfcfd9d99cb415407b7814d567c1f87cff440d6e8ced68ab [2024-11-20 05:28:06,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:28:06,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:28:06,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:28:06,413 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:28:06,413 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:28:06,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i [2024-11-20 05:28:07,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:28:07,809 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:28:07,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i [2024-11-20 05:28:07,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb570b58/7ddd5ae704624847a074f0d2835e1306/FLAG75bb42b9f [2024-11-20 05:28:07,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb570b58/7ddd5ae704624847a074f0d2835e1306 [2024-11-20 05:28:07,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:28:07,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:28:07,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:28:07,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:28:07,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:28:07,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:28:07" (1/1) ... [2024-11-20 05:28:07,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b8ad2f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:07, skipping insertion in model container [2024-11-20 05:28:07,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:28:07" (1/1) ... [2024-11-20 05:28:07,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:28:07,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i[919,932] [2024-11-20 05:28:08,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:28:08,062 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:28:08,070 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i[919,932] [2024-11-20 05:28:08,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:28:08,120 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:28:08,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:08 WrapperNode [2024-11-20 05:28:08,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:28:08,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:28:08,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:28:08,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:28:08,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:08" (1/1) ... [2024-11-20 05:28:08,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:08" (1/1) ... [2024-11-20 05:28:08,175 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2024-11-20 05:28:08,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:28:08,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:28:08,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:28:08,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:28:08,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:08" (1/1) ... [2024-11-20 05:28:08,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:08" (1/1) ... [2024-11-20 05:28:08,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:08" (1/1) ... [2024-11-20 05:28:08,208 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 05:28:08,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:08" (1/1) ... [2024-11-20 05:28:08,208 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:08" (1/1) ... [2024-11-20 05:28:08,220 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:08" (1/1) ... [2024-11-20 05:28:08,228 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:08" (1/1) ... [2024-11-20 05:28:08,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:08" (1/1) ... [2024-11-20 05:28:08,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:08" (1/1) ... [2024-11-20 05:28:08,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:28:08,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:28:08,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:28:08,237 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:28:08,238 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:08" (1/1) ... [2024-11-20 05:28:08,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:28:08,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:28:08,269 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 05:28:08,271 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 05:28:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:28:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:28:08,304 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:28:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:28:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:28:08,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:28:08,363 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:28:08,365 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:28:08,724 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 05:28:08,724 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:28:08,735 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:28:08,736 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:28:08,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:28:08 BoogieIcfgContainer [2024-11-20 05:28:08,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:28:08,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:28:08,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:28:08,741 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:28:08,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:28:07" (1/3) ... [2024-11-20 05:28:08,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46218d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:28:08, skipping insertion in model container [2024-11-20 05:28:08,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:08" (2/3) ... [2024-11-20 05:28:08,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46218d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:28:08, skipping insertion in model container [2024-11-20 05:28:08,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:28:08" (3/3) ... [2024-11-20 05:28:08,745 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i [2024-11-20 05:28:08,758 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:28:08,758 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:28:08,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:28:08,816 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;@2adcceb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:28:08,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:28:08,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 68 states have internal predecessors, (102), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 05:28:08,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 05:28:08,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:28:08,837 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:28:08,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:28:08,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:28:08,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1388994005, now seen corresponding path program 1 times [2024-11-20 05:28:08,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:28:08,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419579216] [2024-11-20 05:28:08,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:28:08,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:28:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:28:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:28:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:28:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:28:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:28:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:28:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 05:28:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 05:28:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:28:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:28:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:28:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:28:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 05:28:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 05:28:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 05:28:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:28:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 05:28:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:28:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 05:28:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:28:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 05:28:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:28:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,302 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:28:09,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:28:09,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419579216] [2024-11-20 05:28:09,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419579216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:28:09,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:28:09,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:28:09,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839058874] [2024-11-20 05:28:09,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:28:09,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:28:09,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:28:09,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:28:09,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:28:09,333 INFO L87 Difference]: Start difference. First operand has 92 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 68 states have internal predecessors, (102), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:28:09,483 INFO L93 Difference]: Finished difference Result 260 states and 466 transitions. [2024-11-20 05:28:09,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:28:09,486 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2024-11-20 05:28:09,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:28:09,494 INFO L225 Difference]: With dead ends: 260 [2024-11-20 05:28:09,494 INFO L226 Difference]: Without dead ends: 171 [2024-11-20 05:28:09,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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 05:28:09,499 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 122 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:28:09,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 325 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:28:09,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-20 05:28:09,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 152. [2024-11-20 05:28:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 05:28:09,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 235 transitions. [2024-11-20 05:28:09,547 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 235 transitions. Word has length 152 [2024-11-20 05:28:09,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:28:09,547 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 235 transitions. [2024-11-20 05:28:09,548 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:09,548 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 235 transitions. [2024-11-20 05:28:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 05:28:09,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:28:09,550 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:28:09,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:28:09,551 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:28:09,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:28:09,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1254980499, now seen corresponding path program 1 times [2024-11-20 05:28:09,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:28:09,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383537797] [2024-11-20 05:28:09,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:28:09,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:28:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:28:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:28:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:28:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:28:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:28:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:28:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 05:28:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 05:28:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:28:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:28:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:28:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:28:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 05:28:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 05:28:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 05:28:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:28:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 05:28:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:28:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 05:28:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:28:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 05:28:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:28:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:28:09,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:28:09,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383537797] [2024-11-20 05:28:09,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383537797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:28:09,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:28:09,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:28:09,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508723772] [2024-11-20 05:28:09,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:28:09,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:28:09,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:28:09,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:28:09,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:28:09,706 INFO L87 Difference]: Start difference. First operand 152 states and 235 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:09,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:28:09,782 INFO L93 Difference]: Finished difference Result 375 states and 582 transitions. [2024-11-20 05:28:09,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:28:09,783 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2024-11-20 05:28:09,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:28:09,785 INFO L225 Difference]: With dead ends: 375 [2024-11-20 05:28:09,786 INFO L226 Difference]: Without dead ends: 226 [2024-11-20 05:28:09,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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 05:28:09,787 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 125 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:28:09,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 264 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:28:09,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-20 05:28:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 207. [2024-11-20 05:28:09,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 137 states have internal predecessors, (183), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 05:28:09,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 315 transitions. [2024-11-20 05:28:09,811 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 315 transitions. Word has length 152 [2024-11-20 05:28:09,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:28:09,811 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 315 transitions. [2024-11-20 05:28:09,811 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 315 transitions. [2024-11-20 05:28:09,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 05:28:09,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:28:09,817 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:28:09,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:28:09,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:28:09,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:28:09,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1677682325, now seen corresponding path program 1 times [2024-11-20 05:28:09,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:28:09,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486878402] [2024-11-20 05:28:09,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:28:09,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:28:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:28:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:28:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:28:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:28:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:28:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:28:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 05:28:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 05:28:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:28:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:28:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:28:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:28:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 05:28:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 05:28:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 05:28:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:28:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 05:28:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:28:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 05:28:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:28:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 05:28:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:28:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:28:10,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:28:10,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486878402] [2024-11-20 05:28:10,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486878402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:28:10,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:28:10,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:28:10,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470332940] [2024-11-20 05:28:10,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:28:10,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:28:10,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:28:10,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:28:10,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:28:10,092 INFO L87 Difference]: Start difference. First operand 207 states and 315 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:28:10,159 INFO L93 Difference]: Finished difference Result 611 states and 934 transitions. [2024-11-20 05:28:10,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:28:10,159 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2024-11-20 05:28:10,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:28:10,165 INFO L225 Difference]: With dead ends: 611 [2024-11-20 05:28:10,165 INFO L226 Difference]: Without dead ends: 407 [2024-11-20 05:28:10,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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 05:28:10,168 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 88 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:28:10,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 279 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:28:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-20 05:28:10,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 404. [2024-11-20 05:28:10,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 265 states have (on average 1.3169811320754716) internal successors, (349), 265 states have internal predecessors, (349), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-20 05:28:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 613 transitions. [2024-11-20 05:28:10,213 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 613 transitions. Word has length 152 [2024-11-20 05:28:10,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:28:10,214 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 613 transitions. [2024-11-20 05:28:10,214 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 613 transitions. [2024-11-20 05:28:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-20 05:28:10,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:28:10,219 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:28:10,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 05:28:10,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:28:10,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:28:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1862977455, now seen corresponding path program 1 times [2024-11-20 05:28:10,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:28:10,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751844691] [2024-11-20 05:28:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:28:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:28:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:28:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:28:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:28:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:28:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:28:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:28:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 05:28:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 05:28:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:28:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:28:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:28:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:28:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 05:28:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 05:28:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 05:28:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:28:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 05:28:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:28:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 05:28:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:28:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 05:28:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:28:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:28:10,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:28:10,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751844691] [2024-11-20 05:28:10,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751844691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:28:10,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:28:10,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 05:28:10,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409111181] [2024-11-20 05:28:10,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:28:10,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 05:28:10,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:28:10,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 05:28:10,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:28:10,448 INFO L87 Difference]: Start difference. First operand 404 states and 613 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:10,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:28:10,586 INFO L93 Difference]: Finished difference Result 810 states and 1230 transitions. [2024-11-20 05:28:10,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:28:10,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2024-11-20 05:28:10,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:28:10,593 INFO L225 Difference]: With dead ends: 810 [2024-11-20 05:28:10,593 INFO L226 Difference]: Without dead ends: 409 [2024-11-20 05:28:10,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 05:28:10,599 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 89 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:28:10,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 510 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:28:10,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-20 05:28:10,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2024-11-20 05:28:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 267 states have (on average 1.3146067415730338) internal successors, (351), 267 states have internal predecessors, (351), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-20 05:28:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 615 transitions. [2024-11-20 05:28:10,638 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 615 transitions. Word has length 154 [2024-11-20 05:28:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:28:10,638 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 615 transitions. [2024-11-20 05:28:10,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:10,639 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 615 transitions. [2024-11-20 05:28:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-20 05:28:10,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:28:10,641 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:28:10,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 05:28:10,641 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:28:10,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:28:10,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2081832173, now seen corresponding path program 1 times [2024-11-20 05:28:10,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:28:10,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319126486] [2024-11-20 05:28:10,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:28:10,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:28:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:28:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:28:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:28:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:28:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:28:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:28:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 05:28:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 05:28:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:28:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:28:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:28:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:28:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 05:28:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 05:28:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 05:28:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:28:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 05:28:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:28:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 05:28:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:28:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 05:28:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:28:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:28:10,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:28:10,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319126486] [2024-11-20 05:28:10,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319126486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:28:10,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:28:10,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:28:10,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378573066] [2024-11-20 05:28:10,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:28:10,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:28:10,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:28:10,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:28:10,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:28:10,915 INFO L87 Difference]: Start difference. First operand 406 states and 615 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:11,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:28:11,025 INFO L93 Difference]: Finished difference Result 1192 states and 1809 transitions. [2024-11-20 05:28:11,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:28:11,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2024-11-20 05:28:11,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:28:11,032 INFO L225 Difference]: With dead ends: 1192 [2024-11-20 05:28:11,032 INFO L226 Difference]: Without dead ends: 789 [2024-11-20 05:28:11,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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 05:28:11,035 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 93 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:28:11,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 234 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:28:11,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-11-20 05:28:11,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 787. [2024-11-20 05:28:11,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 510 states have (on average 1.2980392156862746) internal successors, (662), 510 states have internal predecessors, (662), 264 states have call successors, (264), 12 states have call predecessors, (264), 12 states have return successors, (264), 264 states have call predecessors, (264), 264 states have call successors, (264) [2024-11-20 05:28:11,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1190 transitions. [2024-11-20 05:28:11,104 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1190 transitions. Word has length 154 [2024-11-20 05:28:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:28:11,105 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1190 transitions. [2024-11-20 05:28:11,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1190 transitions. [2024-11-20 05:28:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 05:28:11,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:28:11,107 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:28:11,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 05:28:11,107 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:28:11,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:28:11,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1081100782, now seen corresponding path program 1 times [2024-11-20 05:28:11,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:28:11,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870515214] [2024-11-20 05:28:11,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:28:11,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:28:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:28:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:28:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:28:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:28:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:28:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:28:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 05:28:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 05:28:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:28:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:28:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:28:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:28:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 05:28:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 05:28:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 05:28:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:28:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 05:28:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:28:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 05:28:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:28:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 05:28:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:28:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:28:11,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:28:11,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870515214] [2024-11-20 05:28:11,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870515214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:28:11,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:28:11,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:28:11,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620259080] [2024-11-20 05:28:11,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:28:11,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:28:11,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:28:11,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:28:11,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:28:11,271 INFO L87 Difference]: Start difference. First operand 787 states and 1190 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:28:11,399 INFO L93 Difference]: Finished difference Result 1575 states and 2382 transitions. [2024-11-20 05:28:11,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:28:11,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-11-20 05:28:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:28:11,405 INFO L225 Difference]: With dead ends: 1575 [2024-11-20 05:28:11,405 INFO L226 Difference]: Without dead ends: 791 [2024-11-20 05:28:11,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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 05:28:11,408 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 83 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 408 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.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:28:11,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 408 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:28:11,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-11-20 05:28:11,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 785. [2024-11-20 05:28:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 508 states have (on average 1.2913385826771653) internal successors, (656), 508 states have internal predecessors, (656), 264 states have call successors, (264), 12 states have call predecessors, (264), 12 states have return successors, (264), 264 states have call predecessors, (264), 264 states have call successors, (264) [2024-11-20 05:28:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1184 transitions. [2024-11-20 05:28:11,456 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1184 transitions. Word has length 156 [2024-11-20 05:28:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:28:11,457 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1184 transitions. [2024-11-20 05:28:11,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1184 transitions. [2024-11-20 05:28:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 05:28:11,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:28:11,458 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:28:11,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 05:28:11,459 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:28:11,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:28:11,459 INFO L85 PathProgramCache]: Analyzing trace with hash -862246064, now seen corresponding path program 1 times [2024-11-20 05:28:11,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:28:11,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079588052] [2024-11-20 05:28:11,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:28:11,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:28:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:28:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:28:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:28:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:28:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:28:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:28:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 05:28:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 05:28:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:28:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:28:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:28:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:28:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 05:28:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 05:28:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 05:28:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:28:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 05:28:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 05:28:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 05:28:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:28:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 05:28:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:28:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:28:11,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:28:11,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079588052] [2024-11-20 05:28:11,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079588052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:28:11,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:28:11,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 05:28:11,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635595103] [2024-11-20 05:28:11,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:28:11,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 05:28:11,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:28:11,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 05:28:11,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:28:11,697 INFO L87 Difference]: Start difference. First operand 785 states and 1184 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:11,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:28:11,823 INFO L93 Difference]: Finished difference Result 987 states and 1490 transitions. [2024-11-20 05:28:11,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:28:11,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-11-20 05:28:11,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:28:11,826 INFO L225 Difference]: With dead ends: 987 [2024-11-20 05:28:11,826 INFO L226 Difference]: Without dead ends: 205 [2024-11-20 05:28:11,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:28:11,831 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 137 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:28:11,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 225 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:28:11,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-20 05:28:11,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 135. [2024-11-20 05:28:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.25) internal successors, (110), 88 states have internal predecessors, (110), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 05:28:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-11-20 05:28:11,847 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2024-11-20 05:28:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:28:11,847 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-11-20 05:28:11,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-11-20 05:28:11,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 05:28:11,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:28:11,849 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:28:11,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 05:28:11,849 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:28:11,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:28:11,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1480311400, now seen corresponding path program 1 times [2024-11-20 05:28:11,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:28:11,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821389557] [2024-11-20 05:28:11,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:28:11,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:28:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 05:28:11,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1967249509] [2024-11-20 05:28:11,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:28:11,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:28:11,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:28:11,911 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 05:28:11,912 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 05:28:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:28:12,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 05:28:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:28:12,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 05:28:12,152 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 05:28:12,153 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 05:28:12,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 05:28:12,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:28:12,358 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:28:12,451 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 05:28:12,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:28:12 BoogieIcfgContainer [2024-11-20 05:28:12,455 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 05:28:12,456 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 05:28:12,456 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 05:28:12,456 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 05:28:12,457 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:28:08" (3/4) ... [2024-11-20 05:28:12,459 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 05:28:12,460 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 05:28:12,460 INFO L158 Benchmark]: Toolchain (without parser) took 4629.24ms. Allocated memory was 142.6MB in the beginning and 232.8MB in the end (delta: 90.2MB). Free memory was 73.1MB in the beginning and 106.6MB in the end (delta: -33.5MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2024-11-20 05:28:12,460 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 93.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:28:12,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.22ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 72.7MB in the beginning and 163.3MB in the end (delta: -90.5MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-11-20 05:28:12,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.95ms. Allocated memory is still 192.9MB. Free memory was 163.3MB in the beginning and 159.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 05:28:12,461 INFO L158 Benchmark]: Boogie Preprocessor took 60.21ms. Allocated memory is still 192.9MB. Free memory was 159.1MB in the beginning and 153.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 05:28:12,461 INFO L158 Benchmark]: RCFGBuilder took 499.12ms. Allocated memory is still 192.9MB. Free memory was 153.8MB in the beginning and 125.5MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-20 05:28:12,461 INFO L158 Benchmark]: TraceAbstraction took 3717.65ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 124.5MB in the beginning and 106.6MB in the end (delta: 17.9MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2024-11-20 05:28:12,462 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 232.8MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:28:12,463 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.15ms. Allocated memory is still 142.6MB. Free memory is still 93.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.22ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 72.7MB in the beginning and 163.3MB in the end (delta: -90.5MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.95ms. Allocated memory is still 192.9MB. Free memory was 163.3MB in the beginning and 159.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.21ms. Allocated memory is still 192.9MB. Free memory was 159.1MB in the beginning and 153.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 499.12ms. Allocated memory is still 192.9MB. Free memory was 153.8MB in the beginning and 125.5MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3717.65ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 124.5MB in the beginning and 106.6MB in the end (delta: 17.9MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 232.8MB. Free memory is still 106.6MB. 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 203, overapproximation of someBinaryFLOATComparisonOperation at line 203, overapproximation of bitwiseOr at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -256; [L23] signed short int var_1_5 = -256; [L24] double var_1_7 = 256.25; [L25] double var_1_8 = 127.8; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] float var_1_12 = 999.75; [L29] float var_1_13 = 64.5; [L30] float var_1_14 = 127.25; [L31] signed char var_1_15 = -32; [L32] float var_1_16 = 32.7; [L33] unsigned char var_1_17 = 16; [L34] unsigned char var_1_18 = 32; [L35] unsigned short int var_1_19 = 5; [L36] signed long int var_1_21 = 100; [L37] signed short int var_1_22 = 50; [L38] double var_1_23 = 1000000.75; [L39] unsigned long int var_1_24 = 16; [L40] double var_1_28 = 15.5; [L41] double var_1_29 = 256.7; [L42] unsigned long int var_1_30 = 5; [L43] signed long int var_1_32 = 32; [L44] float var_1_34 = 7.5; [L45] unsigned short int var_1_35 = 100; [L46] signed short int var_1_36 = -4; [L47] unsigned short int var_1_37 = 47055; [L48] signed char var_1_39 = -64; [L49] double var_1_40 = 16.75; [L50] signed char var_1_41 = 16; [L51] signed long int last_1_var_1_1 = -256; [L52] signed short int last_1_var_1_5 = -256; [L53] unsigned char last_1_var_1_10 = 0; [L54] unsigned short int last_1_var_1_19 = 5; [L55] signed short int last_1_var_1_22 = 50; VAL [isInitial=0, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5] [L207] isInitial = 1 [L208] FCALL initially() [L209] COND TRUE 1 [L210] CALL updateLastVariables() [L196] last_1_var_1_1 = var_1_1 [L197] last_1_var_1_5 = var_1_5 [L198] last_1_var_1_10 = var_1_10 [L199] last_1_var_1_19 = var_1_19 [L200] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5] [L210] RET updateLastVariables() [L211] CALL updateVariables() [L159] var_1_7 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_8=639/5] [L160] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_8=639/5] [L161] var_1_8 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L162] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L163] var_1_11 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L164] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L165] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L165] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L166] var_1_13 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L167] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L168] var_1_14 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L169] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L170] var_1_15 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_15 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L171] RET assume_abort_if_not(var_1_15 >= -128) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L172] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L172] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L173] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L173] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L174] var_1_16 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L175] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L176] var_1_18 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L177] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L178] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L178] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L179] var_1_29 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L180] RET assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L181] var_1_36 = __VERIFIER_nondet_short() [L182] CALL assume_abort_if_not(var_1_36 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L182] RET assume_abort_if_not(var_1_36 >= -32768) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L183] CALL assume_abort_if_not(var_1_36 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L183] RET assume_abort_if_not(var_1_36 <= 32767) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L184] CALL assume_abort_if_not(var_1_36 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L184] RET assume_abort_if_not(var_1_36 != 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L185] var_1_37 = __VERIFIER_nondet_ushort() [L186] CALL assume_abort_if_not(var_1_37 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L186] RET assume_abort_if_not(var_1_37 >= 32767) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L187] CALL assume_abort_if_not(var_1_37 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L187] RET assume_abort_if_not(var_1_37 <= 65534) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L188] var_1_40 = __VERIFIER_nondet_double() [L189] CALL assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L189] RET assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L190] CALL assume_abort_if_not(var_1_40 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L190] RET assume_abort_if_not(var_1_40 != 0.0F) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L191] var_1_41 = __VERIFIER_nondet_char() [L192] CALL assume_abort_if_not(var_1_41 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L192] RET assume_abort_if_not(var_1_41 >= -127) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L193] CALL assume_abort_if_not(var_1_41 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L193] RET assume_abort_if_not(var_1_41 <= 126) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L211] RET updateVariables() [L212] CALL step() [L59] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L62] COND TRUE var_1_1 < var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L63] EXPR var_1_1 ^ var_1_17 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L63] COND FALSE !(var_1_19 < (var_1_1 ^ var_1_17)) [L73] COND FALSE !(var_1_10 || var_1_10) [L76] var_1_30 = var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L78] COND FALSE !(var_1_29 > var_1_12) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L89] var_1_34 = var_1_29 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L90] EXPR (var_1_22 % var_1_36) ^ var_1_17 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=100, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L90] COND TRUE ((var_1_22 % var_1_36) ^ var_1_17) != var_1_21 [L91] var_1_35 = (((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) - var_1_17) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L93] COND FALSE !(((var_1_12 / var_1_40) * var_1_12) > var_1_29) [L102] var_1_39 = var_1_41 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L104] signed long int stepLocal_2 = last_1_var_1_5; [L105] unsigned char stepLocal_1 = last_1_var_1_10; [L106] signed long int stepLocal_0 = 256; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_1=0, stepLocal_2=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L107] COND FALSE !(stepLocal_1 && (last_1_var_1_5 >= last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_2=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L112] COND TRUE last_1_var_1_1 >= stepLocal_2 [L113] var_1_1 = last_1_var_1_5 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L118] var_1_10 = (last_1_var_1_10 && var_1_11) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L119] COND FALSE !(var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L124] var_1_22 = last_1_var_1_22 [L125] var_1_23 = var_1_14 [L126] unsigned char stepLocal_5 = var_1_10; [L127] unsigned char stepLocal_4 = var_1_18; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_4=51, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L128] COND TRUE var_1_22 < stepLocal_4 [L129] var_1_19 = last_1_var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L137] var_1_21 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L138] COND TRUE ! (var_1_23 <= var_1_7) [L139] var_1_12 = ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L147] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_3=0, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L148] COND FALSE !(var_1_10 && stepLocal_3) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L151] COND TRUE (var_1_7 - var_1_8) > var_1_12 [L152] var_1_5 = var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=5] [L212] RET step() [L213] CALL, EXPR property() [L203-L204] return (((((((((last_1_var_1_10 && (last_1_var_1_5 >= last_1_var_1_1)) ? ((256 != last_1_var_1_5) ? (var_1_1 == ((signed long int) (last_1_var_1_1 + last_1_var_1_5))) : 1) : ((last_1_var_1_1 >= last_1_var_1_5) ? (var_1_1 == ((signed long int) last_1_var_1_5)) : (var_1_1 == ((signed long int) last_1_var_1_1)))) && ((var_1_10 && var_1_10) ? (var_1_5 == ((signed short int) ((((var_1_19) < (-100)) ? (var_1_19) : (-100))))) : (((var_1_7 - var_1_8) > var_1_12) ? (var_1_5 == ((signed short int) var_1_19)) : (var_1_5 == ((signed short int) var_1_19))))) && (var_1_10 == ((unsigned char) (last_1_var_1_10 && var_1_11)))) && ((! (var_1_23 <= var_1_7)) ? (var_1_12 == ((float) ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) : (((((((var_1_1) > (var_1_17)) ? (var_1_1) : (var_1_17))) / var_1_15) < var_1_19) ? (var_1_12 == ((float) var_1_13)) : (var_1_12 == ((float) (var_1_16 + 49.6f)))))) && ((var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) ? (var_1_10 ? (var_1_17 == ((unsigned char) var_1_18)) : 1) : 1)) && ((var_1_22 < var_1_18) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (((var_1_10 || var_1_10) || var_1_10) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (var_1_19 == ((unsigned short int) var_1_22))))) && (var_1_21 == ((signed long int) var_1_22))) && (var_1_22 == ((signed short int) last_1_var_1_22))) && (var_1_23 == ((double) var_1_14)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=5] [L213] RET, EXPR property() [L213] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=17, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=50, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 8, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 737 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 737 mSDsluCounter, 2245 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1185 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 309 IncrementalHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 1060 mSDtfsCounter, 309 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=787occurred in iteration=5, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 122 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1390 NumberOfCodeBlocks, 1390 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1069 ConstructedInterpolants, 0 QuantifiedInterpolants, 2081 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 6468/6468 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 05:28:12,487 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-ps-co_file-25.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 ff8bee30ebc0a54ebfcfd9d99cb415407b7814d567c1f87cff440d6e8ced68ab --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:28:14,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:28:14,362 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 05:28:14,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:28:14,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:28:14,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:28:14,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:28:14,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:28:14,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:28:14,400 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:28:14,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:28:14,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:28:14,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:28:14,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:28:14,403 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:28:14,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:28:14,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:28:14,404 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:28:14,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:28:14,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:28:14,407 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:28:14,407 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:28:14,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:28:14,407 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 05:28:14,407 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 05:28:14,408 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:28:14,408 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 05:28:14,408 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:28:14,408 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:28:14,408 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:28:14,408 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:28:14,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:28:14,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:28:14,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:28:14,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:28:14,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:28:14,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:28:14,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:28:14,411 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 05:28:14,411 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 05:28:14,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:28:14,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:28:14,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:28:14,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:28:14,412 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 -> ff8bee30ebc0a54ebfcfd9d99cb415407b7814d567c1f87cff440d6e8ced68ab [2024-11-20 05:28:14,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:28:14,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:28:14,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:28:14,680 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:28:14,680 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:28:14,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i [2024-11-20 05:28:15,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:28:16,110 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:28:16,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i [2024-11-20 05:28:16,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba236d69/a8d3ca3f9ba549a99aa44eee4da77583/FLAG8782250d0 [2024-11-20 05:28:16,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba236d69/a8d3ca3f9ba549a99aa44eee4da77583 [2024-11-20 05:28:16,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:28:16,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:28:16,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:28:16,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:28:16,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:28:16,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:28:16" (1/1) ... [2024-11-20 05:28:16,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a03b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:16, skipping insertion in model container [2024-11-20 05:28:16,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:28:16" (1/1) ... [2024-11-20 05:28:16,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:28:16,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i[919,932] [2024-11-20 05:28:16,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:28:16,424 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:28:16,435 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i[919,932] [2024-11-20 05:28:16,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:28:16,494 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:28:16,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:16 WrapperNode [2024-11-20 05:28:16,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:28:16,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:28:16,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:28:16,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:28:16,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:16" (1/1) ... [2024-11-20 05:28:16,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:16" (1/1) ... [2024-11-20 05:28:16,547 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-11-20 05:28:16,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:28:16,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:28:16,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:28:16,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:28:16,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:16" (1/1) ... [2024-11-20 05:28:16,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:16" (1/1) ... [2024-11-20 05:28:16,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:16" (1/1) ... [2024-11-20 05:28:16,585 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 05:28:16,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:16" (1/1) ... [2024-11-20 05:28:16,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:16" (1/1) ... [2024-11-20 05:28:16,597 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:16" (1/1) ... [2024-11-20 05:28:16,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:16" (1/1) ... [2024-11-20 05:28:16,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:16" (1/1) ... [2024-11-20 05:28:16,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:16" (1/1) ... [2024-11-20 05:28:16,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:28:16,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:28:16,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:28:16,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:28:16,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:16" (1/1) ... [2024-11-20 05:28:16,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:28:16,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:28:16,649 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 05:28:16,651 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 05:28:16,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:28:16,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 05:28:16,685 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:28:16,685 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:28:16,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:28:16,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:28:16,758 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:28:16,760 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:28:28,411 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 05:28:28,411 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:28:28,420 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:28:28,422 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:28:28,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:28:28 BoogieIcfgContainer [2024-11-20 05:28:28,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:28:28,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:28:28,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:28:28,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:28:28,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:28:16" (1/3) ... [2024-11-20 05:28:28,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56706af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:28:28, skipping insertion in model container [2024-11-20 05:28:28,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:16" (2/3) ... [2024-11-20 05:28:28,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56706af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:28:28, skipping insertion in model container [2024-11-20 05:28:28,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:28:28" (3/3) ... [2024-11-20 05:28:28,427 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i [2024-11-20 05:28:28,439 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:28:28,439 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:28:28,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:28:28,506 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;@2b64ede1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:28:28,506 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:28:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 60 states have internal predecessors, (88), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 05:28:28,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-20 05:28:28,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:28:28,520 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:28:28,520 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:28:28,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:28:28,524 INFO L85 PathProgramCache]: Analyzing trace with hash -941019790, now seen corresponding path program 1 times [2024-11-20 05:28:28,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:28:28,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214983147] [2024-11-20 05:28:28,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:28:28,534 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 05:28:28,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:28:28,536 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 05:28:28,559 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 05:28:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:29,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 05:28:29,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:28:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-20 05:28:29,582 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:28:29,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:28:29,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214983147] [2024-11-20 05:28:29,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214983147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:28:29,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:28:29,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:28:29,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680284200] [2024-11-20 05:28:29,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:28:29,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:28:29,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:28:29,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:28:29,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:28:29,636 INFO L87 Difference]: Start difference. First operand has 84 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 60 states have internal predecessors, (88), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 05:28:29,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:28:29,670 INFO L93 Difference]: Finished difference Result 161 states and 280 transitions. [2024-11-20 05:28:29,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:28:29,675 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 151 [2024-11-20 05:28:29,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:28:29,683 INFO L225 Difference]: With dead ends: 161 [2024-11-20 05:28:29,683 INFO L226 Difference]: Without dead ends: 80 [2024-11-20 05:28:29,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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 05:28:29,694 INFO L432 NwaCegarLoop]: 125 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, 125 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 05:28:29,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:28:29,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-20 05:28:29,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-20 05:28:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 56 states have internal predecessors, (81), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 05:28:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2024-11-20 05:28:29,747 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 151 [2024-11-20 05:28:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:28:29,748 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2024-11-20 05:28:29,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 05:28:29,749 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2024-11-20 05:28:29,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-20 05:28:29,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:28:29,754 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:28:29,788 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 05:28:29,955 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 05:28:29,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:28:29,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:28:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash 489901106, now seen corresponding path program 1 times [2024-11-20 05:28:29,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:28:29,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712619883] [2024-11-20 05:28:29,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:28:29,958 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 05:28:29,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:28:29,961 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 05:28:29,962 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 05:28:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:30,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 05:28:30,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:28:35,925 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:28:35,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:28:35,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:28:35,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712619883] [2024-11-20 05:28:35,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712619883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:28:35,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:28:35,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:28:35,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610153518] [2024-11-20 05:28:35,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:28:35,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:28:35,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:28:35,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:28:35,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:28:35,930 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:36,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:28:36,996 INFO L93 Difference]: Finished difference Result 232 states and 365 transitions. [2024-11-20 05:28:36,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:28:36,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2024-11-20 05:28:36,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:28:37,000 INFO L225 Difference]: With dead ends: 232 [2024-11-20 05:28:37,000 INFO L226 Difference]: Without dead ends: 155 [2024-11-20 05:28:37,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:28:37,001 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 50 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:28:37,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 236 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 05:28:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-20 05:28:37,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 140. [2024-11-20 05:28:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 93 states have internal predecessors, (127), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 05:28:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 215 transitions. [2024-11-20 05:28:37,024 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 215 transitions. Word has length 151 [2024-11-20 05:28:37,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:28:37,026 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 215 transitions. [2024-11-20 05:28:37,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:37,026 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 215 transitions. [2024-11-20 05:28:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-20 05:28:37,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:28:37,028 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:28:37,057 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 05:28:37,229 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 05:28:37,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:28:37,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:28:37,230 INFO L85 PathProgramCache]: Analyzing trace with hash -2133185678, now seen corresponding path program 1 times [2024-11-20 05:28:37,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:28:37,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539236108] [2024-11-20 05:28:37,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:28:37,231 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 05:28:37,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:28:37,232 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 05:28:37,233 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 05:28:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:38,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 05:28:38,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:28:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:28:43,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:28:43,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:28:43,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539236108] [2024-11-20 05:28:43,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539236108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:28:43,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:28:43,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:28:43,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332670890] [2024-11-20 05:28:43,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:28:43,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:28:43,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:28:43,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:28:43,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:28:43,431 INFO L87 Difference]: Start difference. First operand 140 states and 215 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:44,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:28:44,374 INFO L93 Difference]: Finished difference Result 410 states and 632 transitions. [2024-11-20 05:28:44,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:28:44,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2024-11-20 05:28:44,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:28:44,378 INFO L225 Difference]: With dead ends: 410 [2024-11-20 05:28:44,378 INFO L226 Difference]: Without dead ends: 273 [2024-11-20 05:28:44,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:28:44,379 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 50 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 05:28:44,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 258 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 05:28:44,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-20 05:28:44,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 270. [2024-11-20 05:28:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 177 states have (on average 1.3389830508474576) internal successors, (237), 177 states have internal predecessors, (237), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-20 05:28:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 413 transitions. [2024-11-20 05:28:44,407 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 413 transitions. Word has length 151 [2024-11-20 05:28:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:28:44,411 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 413 transitions. [2024-11-20 05:28:44,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 413 transitions. [2024-11-20 05:28:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-20 05:28:44,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:28:44,413 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:28:44,460 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 05:28:44,613 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 05:28:44,614 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:28:44,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:28:44,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1672550036, now seen corresponding path program 1 times [2024-11-20 05:28:44,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:28:44,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915374783] [2024-11-20 05:28:44,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:28:44,615 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 05:28:44,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:28:44,618 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 05:28:44,619 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 05:28:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:45,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 05:28:45,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:28:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:28:51,096 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:28:51,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:28:51,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915374783] [2024-11-20 05:28:51,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915374783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:28:51,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:28:51,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 05:28:51,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777636999] [2024-11-20 05:28:51,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:28:51,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 05:28:51,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:28:51,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 05:28:51,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:28:51,099 INFO L87 Difference]: Start difference. First operand 270 states and 413 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:52,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:28:52,518 INFO L93 Difference]: Finished difference Result 456 states and 697 transitions. [2024-11-20 05:28:52,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:28:52,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2024-11-20 05:28:52,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:28:52,522 INFO L225 Difference]: With dead ends: 456 [2024-11-20 05:28:52,522 INFO L226 Difference]: Without dead ends: 189 [2024-11-20 05:28:52,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:28:52,524 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 116 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:28:52,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 201 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 05:28:52,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-20 05:28:52,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 123. [2024-11-20 05:28:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.236842105263158) internal successors, (94), 76 states have internal predecessors, (94), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 05:28:52,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 182 transitions. [2024-11-20 05:28:52,543 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 182 transitions. Word has length 151 [2024-11-20 05:28:52,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:28:52,544 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 182 transitions. [2024-11-20 05:28:52,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:28:52,544 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 182 transitions. [2024-11-20 05:28:52,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 05:28:52,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:28:52,546 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:28:52,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-20 05:28:52,747 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 05:28:52,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:28:52,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:28:52,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1841048040, now seen corresponding path program 1 times [2024-11-20 05:28:52,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:28:52,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969920222] [2024-11-20 05:28:52,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:28:52,748 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 05:28:52,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:28:52,750 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 05:28:52,751 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 05:28:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:28:53,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 05:28:53,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:29:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:29:04,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:29:04,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:29:04,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969920222] [2024-11-20 05:29:04,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969920222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:29:04,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:29:04,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:29:04,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025915941] [2024-11-20 05:29:04,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:29:04,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 05:29:04,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:29:04,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 05:29:04,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:29:04,643 INFO L87 Difference]: Start difference. First operand 123 states and 182 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:29:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:29:08,614 INFO L93 Difference]: Finished difference Result 230 states and 341 transitions. [2024-11-20 05:29:08,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 05:29:08,627 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2024-11-20 05:29:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:29:08,629 INFO L225 Difference]: With dead ends: 230 [2024-11-20 05:29:08,629 INFO L226 Difference]: Without dead ends: 154 [2024-11-20 05:29:08,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:29:08,630 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 95 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-20 05:29:08,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 379 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-20 05:29:08,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-20 05:29:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 135. [2024-11-20 05:29:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 88 states have internal predecessors, (113), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 05:29:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2024-11-20 05:29:08,649 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 152 [2024-11-20 05:29:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:29:08,649 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2024-11-20 05:29:08,650 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:29:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2024-11-20 05:29:08,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 05:29:08,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:29:08,651 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:29:08,687 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 (6)] Forceful destruction successful, exit code 0 [2024-11-20 05:29:08,856 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 05:29:08,856 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:29:08,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:29:08,857 INFO L85 PathProgramCache]: Analyzing trace with hash -829930790, now seen corresponding path program 1 times [2024-11-20 05:29:08,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:29:08,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099748444] [2024-11-20 05:29:08,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:29:08,858 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 05:29:08,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:29:08,860 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 05:29:08,861 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 05:29:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:09,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-20 05:29:09,890 INFO L278 TraceCheckSpWp]: Computing forward predicates...