./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.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 c7afbbb4b2e6924bc13d55806a21ab7f087433beabc76695e33c51517c3d4e0b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:19:19,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:19:19,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:19:19,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:19:19,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:19:19,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:19:19,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:19:19,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:19:19,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:19:19,200 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:19:19,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:19:19,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:19:19,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:19:19,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:19:19,202 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:19:19,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:19:19,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:19:19,203 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:19:19,204 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:19:19,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:19:19,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:19:19,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:19:19,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:19:19,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:19:19,206 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:19:19,206 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:19:19,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:19:19,207 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:19:19,207 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:19:19,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:19:19,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:19:19,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:19:19,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:19:19,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:19:19,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:19:19,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:19:19,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:19:19,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:19:19,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:19:19,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:19:19,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:19:19,211 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:19:19,211 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 -> c7afbbb4b2e6924bc13d55806a21ab7f087433beabc76695e33c51517c3d4e0b [2024-11-08 23:19:19,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:19:19,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:19:19,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:19:19,495 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:19:19,496 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:19:19,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i [2024-11-08 23:19:20,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:19:21,139 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:19:21,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i [2024-11-08 23:19:21,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98e6f17ea/50a97c352fa649bdac454e8c06744c34/FLAG1211f1f3d [2024-11-08 23:19:21,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98e6f17ea/50a97c352fa649bdac454e8c06744c34 [2024-11-08 23:19:21,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:19:21,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:19:21,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:19:21,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:19:21,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:19:21,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:19:21" (1/1) ... [2024-11-08 23:19:21,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c1c77d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:21, skipping insertion in model container [2024-11-08 23:19:21,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:19:21" (1/1) ... [2024-11-08 23:19:21,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:19:21,425 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_loopvsstraightlinecode_100-1loop_file-38.i[916,929] [2024-11-08 23:19:21,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:19:21,523 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:19:21,534 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_loopvsstraightlinecode_100-1loop_file-38.i[916,929] [2024-11-08 23:19:21,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:19:21,589 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:19:21,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:21 WrapperNode [2024-11-08 23:19:21,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:19:21,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:19:21,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:19:21,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:19:21,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:21" (1/1) ... [2024-11-08 23:19:21,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:21" (1/1) ... [2024-11-08 23:19:21,660 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2024-11-08 23:19:21,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:19:21,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:19:21,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:19:21,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:19:21,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:21" (1/1) ... [2024-11-08 23:19:21,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:21" (1/1) ... [2024-11-08 23:19:21,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:21" (1/1) ... [2024-11-08 23:19:21,708 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:19:21,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:21" (1/1) ... [2024-11-08 23:19:21,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:21" (1/1) ... [2024-11-08 23:19:21,731 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:21" (1/1) ... [2024-11-08 23:19:21,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:21" (1/1) ... [2024-11-08 23:19:21,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:21" (1/1) ... [2024-11-08 23:19:21,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:21" (1/1) ... [2024-11-08 23:19:21,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:19:21,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:19:21,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:19:21,761 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:19:21,762 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:21" (1/1) ... [2024-11-08 23:19:21,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:19:21,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:19:21,791 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:19:21,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:19:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:19:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:19:21,832 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:19:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:19:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:19:21,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:19:21,908 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:19:21,910 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:19:22,308 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-08 23:19:22,308 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:19:22,324 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:19:22,325 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:19:22,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:19:22 BoogieIcfgContainer [2024-11-08 23:19:22,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:19:22,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:19:22,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:19:22,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:19:22,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:19:21" (1/3) ... [2024-11-08 23:19:22,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47bb3ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:19:22, skipping insertion in model container [2024-11-08 23:19:22,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:21" (2/3) ... [2024-11-08 23:19:22,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47bb3ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:19:22, skipping insertion in model container [2024-11-08 23:19:22,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:19:22" (3/3) ... [2024-11-08 23:19:22,336 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-38.i [2024-11-08 23:19:22,351 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:19:22,351 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:19:22,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:19:22,432 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;@3722643e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:19:22,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:19:22,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 50 states have (on average 1.52) internal successors, (76), 51 states have internal predecessors, (76), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:19:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:19:22,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:22,450 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:22,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:22,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:22,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1674220312, now seen corresponding path program 1 times [2024-11-08 23:19:22,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:22,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314211908] [2024-11-08 23:19:22,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:22,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:22,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:22,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:22,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:19:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:22,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:22,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:19:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:22,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:19:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:22,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:19:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:22,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:19:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:22,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:19:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:22,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:19:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:22,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:19:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:22,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:19:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:22,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:19:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:22,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:19:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:22,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:19:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:22,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:19:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:22,882 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:19:22,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:22,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314211908] [2024-11-08 23:19:22,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314211908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:22,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:22,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:19:22,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704468530] [2024-11-08 23:19:22,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:22,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:19:22,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:22,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:19:22,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:19:22,916 INFO L87 Difference]: Start difference. First operand has 69 states, 50 states have (on average 1.52) internal successors, (76), 51 states have internal predecessors, (76), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 23:19:22,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:22,938 INFO L93 Difference]: Finished difference Result 135 states and 229 transitions. [2024-11-08 23:19:22,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:19:22,941 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 113 [2024-11-08 23:19:22,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:22,949 INFO L225 Difference]: With dead ends: 135 [2024-11-08 23:19:22,949 INFO L226 Difference]: Without dead ends: 65 [2024-11-08 23:19:22,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:19:22,954 INFO L432 NwaCegarLoop]: 105 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, 105 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:22,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:19:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-08 23:19:22,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-08 23:19:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 47 states have internal predecessors, (69), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:19:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 101 transitions. [2024-11-08 23:19:22,996 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 101 transitions. Word has length 113 [2024-11-08 23:19:22,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:22,996 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 101 transitions. [2024-11-08 23:19:22,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 23:19:22,997 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 101 transitions. [2024-11-08 23:19:22,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:19:23,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:23,000 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:23,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:19:23,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:23,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:23,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2044782116, now seen corresponding path program 1 times [2024-11-08 23:19:23,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:23,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829673208] [2024-11-08 23:19:23,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:23,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:23,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:23,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:23,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:19:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:23,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:23,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:19:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:23,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:19:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:23,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:19:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:23,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:19:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:23,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:19:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:23,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:19:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:23,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:19:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:23,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:19:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:23,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:19:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:23,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:19:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:23,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:19:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:23,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:19:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:19:23,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:23,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829673208] [2024-11-08 23:19:23,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829673208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:23,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:23,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:19:23,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907508551] [2024-11-08 23:19:23,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:23,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:19:23,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:23,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:19:23,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:19:23,754 INFO L87 Difference]: Start difference. First operand 65 states and 101 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 23:19:23,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:23,934 INFO L93 Difference]: Finished difference Result 262 states and 401 transitions. [2024-11-08 23:19:23,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:19:23,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-11-08 23:19:23,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:23,939 INFO L225 Difference]: With dead ends: 262 [2024-11-08 23:19:23,942 INFO L226 Difference]: Without dead ends: 200 [2024-11-08 23:19:23,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-08 23:19:23,945 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 215 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:23,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 430 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:19:23,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-08 23:19:23,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 104. [2024-11-08 23:19:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 23:19:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2024-11-08 23:19:23,985 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 113 [2024-11-08 23:19:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:23,986 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2024-11-08 23:19:23,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 23:19:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2024-11-08 23:19:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:19:23,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:23,988 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:23,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:19:23,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:23,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:23,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1457976102, now seen corresponding path program 1 times [2024-11-08 23:19:23,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:23,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241209513] [2024-11-08 23:19:23,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:23,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:19:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:19:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:19:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:19:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:19:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:19:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:19:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:19:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:19:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:19:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:19:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:19:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:19:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:19:24,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:24,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241209513] [2024-11-08 23:19:24,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241209513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:24,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:24,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:19:24,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50573366] [2024-11-08 23:19:24,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:24,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:19:24,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:24,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:19:24,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:19:24,632 INFO L87 Difference]: Start difference. First operand 104 states and 159 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 23:19:24,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:24,745 INFO L93 Difference]: Finished difference Result 259 states and 399 transitions. [2024-11-08 23:19:24,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:19:24,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-11-08 23:19:24,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:24,749 INFO L225 Difference]: With dead ends: 259 [2024-11-08 23:19:24,751 INFO L226 Difference]: Without dead ends: 158 [2024-11-08 23:19:24,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:19:24,754 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 34 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:24,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 331 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:19:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-08 23:19:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 128. [2024-11-08 23:19:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.4951456310679612) internal successors, (154), 104 states have internal predecessors, (154), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 23:19:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 198 transitions. [2024-11-08 23:19:24,779 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 198 transitions. Word has length 113 [2024-11-08 23:19:24,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:24,780 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 198 transitions. [2024-11-08 23:19:24,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 23:19:24,780 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 198 transitions. [2024-11-08 23:19:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 23:19:24,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:24,784 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:24,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:19:24,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:24,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:24,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1288605021, now seen corresponding path program 1 times [2024-11-08 23:19:24,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:24,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110713239] [2024-11-08 23:19:24,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:24,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:19:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:19:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:19:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:19:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:19:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:19:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:19:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:19:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:19:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:19:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:19:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:19:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:19:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:19:24,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:24,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110713239] [2024-11-08 23:19:24,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110713239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:24,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:24,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:19:24,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639561291] [2024-11-08 23:19:24,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:24,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:19:24,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:24,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:19:24,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:19:24,957 INFO L87 Difference]: Start difference. First operand 128 states and 198 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 23:19:25,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:25,098 INFO L93 Difference]: Finished difference Result 370 states and 568 transitions. [2024-11-08 23:19:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:19:25,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-11-08 23:19:25,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:25,103 INFO L225 Difference]: With dead ends: 370 [2024-11-08 23:19:25,104 INFO L226 Difference]: Without dead ends: 245 [2024-11-08 23:19:25,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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-08 23:19:25,108 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 195 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:25,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 402 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:19:25,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-08 23:19:25,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 148. [2024-11-08 23:19:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.4308943089430894) internal successors, (176), 124 states have internal predecessors, (176), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 23:19:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 220 transitions. [2024-11-08 23:19:25,127 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 220 transitions. Word has length 114 [2024-11-08 23:19:25,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:25,128 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 220 transitions. [2024-11-08 23:19:25,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 23:19:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 220 transitions. [2024-11-08 23:19:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 23:19:25,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:25,130 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:25,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:19:25,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:25,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:25,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1968663391, now seen corresponding path program 1 times [2024-11-08 23:19:25,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:25,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402629256] [2024-11-08 23:19:25,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:25,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:25,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:25,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:25,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:19:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:25,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:25,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:19:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:25,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:19:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:25,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:19:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:25,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:19:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:25,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:19:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:25,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:19:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:25,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:19:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:19:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:25,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:19:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:25,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:19:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:25,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:19:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:25,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:19:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-08 23:19:25,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:25,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402629256] [2024-11-08 23:19:25,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402629256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:19:25,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388481407] [2024-11-08 23:19:25,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:25,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:25,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:19:25,456 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:19:25,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:19:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:25,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:19:25,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:19:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 249 proven. 18 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2024-11-08 23:19:25,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:19:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 27 proven. 18 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-08 23:19:25,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388481407] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:19:25,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:19:25,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-08 23:19:25,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851892027] [2024-11-08 23:19:25,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:19:25,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:19:25,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:25,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:19:25,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:19:25,921 INFO L87 Difference]: Start difference. First operand 148 states and 220 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-08 23:19:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:26,221 INFO L93 Difference]: Finished difference Result 264 states and 387 transitions. [2024-11-08 23:19:26,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 23:19:26,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 114 [2024-11-08 23:19:26,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:26,225 INFO L225 Difference]: With dead ends: 264 [2024-11-08 23:19:26,226 INFO L226 Difference]: Without dead ends: 119 [2024-11-08 23:19:26,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2024-11-08 23:19:26,227 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 183 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:26,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 224 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:19:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-08 23:19:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2024-11-08 23:19:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 88 states have internal predecessors, (115), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 23:19:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2024-11-08 23:19:26,239 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 114 [2024-11-08 23:19:26,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:26,240 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2024-11-08 23:19:26,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-08 23:19:26,240 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2024-11-08 23:19:26,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 23:19:26,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:26,241 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:26,260 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-08 23:19:26,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:26,446 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:26,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:26,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2006768498, now seen corresponding path program 1 times [2024-11-08 23:19:26,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:26,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211474998] [2024-11-08 23:19:26,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:26,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:26,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:26,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:26,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:19:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:26,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:26,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:19:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:26,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:19:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:26,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:19:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:26,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:19:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:26,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:19:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:26,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:19:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:26,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:19:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:26,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:19:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:26,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:19:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:26,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:19:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:26,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:19:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:26,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:19:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:19:26,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:26,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211474998] [2024-11-08 23:19:26,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211474998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:26,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:26,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:19:26,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72865639] [2024-11-08 23:19:26,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:26,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:19:26,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:26,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:19:26,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:19:26,941 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 23:19:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:27,080 INFO L93 Difference]: Finished difference Result 261 states and 362 transitions. [2024-11-08 23:19:27,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:19:27,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2024-11-08 23:19:27,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:27,083 INFO L225 Difference]: With dead ends: 261 [2024-11-08 23:19:27,083 INFO L226 Difference]: Without dead ends: 165 [2024-11-08 23:19:27,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:19:27,084 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 159 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:27,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 224 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:19:27,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-08 23:19:27,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 121. [2024-11-08 23:19:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 99 states have internal predecessors, (132), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:19:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 164 transitions. [2024-11-08 23:19:27,097 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 164 transitions. Word has length 115 [2024-11-08 23:19:27,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:27,097 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 164 transitions. [2024-11-08 23:19:27,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 23:19:27,098 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 164 transitions. [2024-11-08 23:19:27,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 23:19:27,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:27,099 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:27,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:19:27,100 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:27,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:27,100 INFO L85 PathProgramCache]: Analyzing trace with hash 775528940, now seen corresponding path program 1 times [2024-11-08 23:19:27,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:27,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502799907] [2024-11-08 23:19:27,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:27,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:28,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:28,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:28,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:19:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:28,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:28,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:19:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:28,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:19:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:28,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:19:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:28,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:19:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:28,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:19:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:28,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:19:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:28,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:19:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:28,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:19:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:28,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:19:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:28,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:19:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:28,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:19:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:28,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:19:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:19:28,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:28,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502799907] [2024-11-08 23:19:28,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502799907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:28,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:28,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 23:19:28,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343813160] [2024-11-08 23:19:28,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:28,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:19:28,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:28,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:19:28,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:19:28,653 INFO L87 Difference]: Start difference. First operand 121 states and 164 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 23:19:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:28,886 INFO L93 Difference]: Finished difference Result 241 states and 327 transitions. [2024-11-08 23:19:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:19:28,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 115 [2024-11-08 23:19:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:28,888 INFO L225 Difference]: With dead ends: 241 [2024-11-08 23:19:28,888 INFO L226 Difference]: Without dead ends: 123 [2024-11-08 23:19:28,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:19:28,889 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 95 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:28,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 264 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:19:28,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-08 23:19:28,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2024-11-08 23:19:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:19:28,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 162 transitions. [2024-11-08 23:19:28,910 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 162 transitions. Word has length 115 [2024-11-08 23:19:28,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:28,911 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 162 transitions. [2024-11-08 23:19:28,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 23:19:28,911 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 162 transitions. [2024-11-08 23:19:28,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 23:19:28,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:28,913 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:28,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 23:19:28,913 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:28,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:28,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1218615766, now seen corresponding path program 1 times [2024-11-08 23:19:28,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:28,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569683716] [2024-11-08 23:19:28,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:28,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:19:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:19:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:19:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:19:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:19:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:19:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:19:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:19:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:19:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:19:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:19:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:19:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:19:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-08 23:19:29,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:29,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569683716] [2024-11-08 23:19:29,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569683716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:19:29,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750962719] [2024-11-08 23:19:29,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:29,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:29,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:19:29,511 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:19:29,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 23:19:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 23:19:29,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:19:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 23:19:29,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:19:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-08 23:19:30,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750962719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:19:30,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:19:30,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2024-11-08 23:19:30,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292129783] [2024-11-08 23:19:30,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:19:30,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 23:19:30,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:30,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 23:19:30,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:19:30,420 INFO L87 Difference]: Start difference. First operand 121 states and 162 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-08 23:19:31,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:31,078 INFO L93 Difference]: Finished difference Result 447 states and 586 transitions. [2024-11-08 23:19:31,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 23:19:31,079 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) Word has length 115 [2024-11-08 23:19:31,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:31,081 INFO L225 Difference]: With dead ends: 447 [2024-11-08 23:19:31,081 INFO L226 Difference]: Without dead ends: 329 [2024-11-08 23:19:31,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=494, Unknown=0, NotChecked=0, Total=702 [2024-11-08 23:19:31,083 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 341 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:31,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 422 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 23:19:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-08 23:19:31,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 129. [2024-11-08 23:19:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.3018867924528301) internal successors, (138), 106 states have internal predecessors, (138), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:19:31,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 170 transitions. [2024-11-08 23:19:31,104 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 170 transitions. Word has length 115 [2024-11-08 23:19:31,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:31,105 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 170 transitions. [2024-11-08 23:19:31,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-08 23:19:31,105 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 170 transitions. [2024-11-08 23:19:31,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 23:19:31,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:31,106 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:31,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:19:31,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-08 23:19:31,311 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:31,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:31,312 INFO L85 PathProgramCache]: Analyzing trace with hash 472128848, now seen corresponding path program 1 times [2024-11-08 23:19:31,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:31,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233870995] [2024-11-08 23:19:31,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:31,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:19:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:19:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:19:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:19:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:19:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:19:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:19:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:19:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:19:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:19:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:19:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:19:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:19:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:19:31,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:31,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233870995] [2024-11-08 23:19:31,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233870995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:31,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:31,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:19:31,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092114599] [2024-11-08 23:19:31,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:31,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:19:31,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:31,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:19:31,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:19:31,456 INFO L87 Difference]: Start difference. First operand 129 states and 170 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 23:19:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:31,482 INFO L93 Difference]: Finished difference Result 255 states and 337 transitions. [2024-11-08 23:19:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:19:31,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-08 23:19:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:31,485 INFO L225 Difference]: With dead ends: 255 [2024-11-08 23:19:31,485 INFO L226 Difference]: Without dead ends: 129 [2024-11-08 23:19:31,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:19:31,486 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:31,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 93 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:19:31,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-08 23:19:31,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-08 23:19:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:19:31,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 169 transitions. [2024-11-08 23:19:31,507 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 169 transitions. Word has length 116 [2024-11-08 23:19:31,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:31,508 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 169 transitions. [2024-11-08 23:19:31,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 23:19:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 169 transitions. [2024-11-08 23:19:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 23:19:31,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:31,510 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:31,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 23:19:31,510 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:31,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:31,511 INFO L85 PathProgramCache]: Analyzing trace with hash 471935370, now seen corresponding path program 1 times [2024-11-08 23:19:31,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:31,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657920367] [2024-11-08 23:19:31,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:31,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:19:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:19:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:19:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:19:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:19:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:19:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:19:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:19:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:19:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:19:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:19:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:19:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:19:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:19:31,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:31,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657920367] [2024-11-08 23:19:31,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657920367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:31,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:31,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:19:31,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300647113] [2024-11-08 23:19:31,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:31,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:19:31,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:31,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:19:31,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:19:31,799 INFO L87 Difference]: Start difference. First operand 129 states and 169 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 23:19:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:31,870 INFO L93 Difference]: Finished difference Result 267 states and 349 transitions. [2024-11-08 23:19:31,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:19:31,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-08 23:19:31,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:31,873 INFO L225 Difference]: With dead ends: 267 [2024-11-08 23:19:31,873 INFO L226 Difference]: Without dead ends: 141 [2024-11-08 23:19:31,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:19:31,874 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 50 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:31,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 220 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:19:31,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-08 23:19:31,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 121. [2024-11-08 23:19:31,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 98 states have internal predecessors, (121), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:19:31,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 153 transitions. [2024-11-08 23:19:31,896 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 153 transitions. Word has length 116 [2024-11-08 23:19:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:31,899 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 153 transitions. [2024-11-08 23:19:31,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 23:19:31,899 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2024-11-08 23:19:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 23:19:31,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:31,900 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:31,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 23:19:31,901 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:31,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:31,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1790846322, now seen corresponding path program 1 times [2024-11-08 23:19:31,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:31,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159581276] [2024-11-08 23:19:31,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:31,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:19:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:19:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:19:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:19:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:19:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:19:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:19:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:19:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:19:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:19:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:19:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:19:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:19:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-08 23:19:32,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:32,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159581276] [2024-11-08 23:19:32,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159581276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:19:32,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476906554] [2024-11-08 23:19:32,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:32,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:32,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:19:32,384 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:19:32,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 23:19:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 23:19:32,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:19:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 23:19:33,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:19:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-08 23:19:33,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476906554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:19:33,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:19:33,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-08 23:19:33,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373898308] [2024-11-08 23:19:33,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:19:33,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 23:19:33,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:33,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 23:19:33,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:19:33,479 INFO L87 Difference]: Start difference. First operand 121 states and 153 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-08 23:19:34,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:34,233 INFO L93 Difference]: Finished difference Result 342 states and 430 transitions. [2024-11-08 23:19:34,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 23:19:34,234 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) Word has length 116 [2024-11-08 23:19:34,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:34,237 INFO L225 Difference]: With dead ends: 342 [2024-11-08 23:19:34,237 INFO L226 Difference]: Without dead ends: 224 [2024-11-08 23:19:34,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=453, Unknown=0, NotChecked=0, Total=650 [2024-11-08 23:19:34,238 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 306 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:34,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 367 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 23:19:34,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-08 23:19:34,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 117. [2024-11-08 23:19:34,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 94 states have internal predecessors, (115), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:19:34,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2024-11-08 23:19:34,259 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 147 transitions. Word has length 116 [2024-11-08 23:19:34,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:34,260 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 147 transitions. [2024-11-08 23:19:34,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-08 23:19:34,261 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 147 transitions. [2024-11-08 23:19:34,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:19:34,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:34,263 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:34,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 23:19:34,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:34,467 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:34,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:34,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1514608673, now seen corresponding path program 1 times [2024-11-08 23:19:34,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:34,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193602702] [2024-11-08 23:19:34,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:34,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:19:34,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [125196851] [2024-11-08 23:19:34,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:34,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:34,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:19:34,560 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:19:34,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 23:19:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:19:34,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:19:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:19:34,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:19:34,975 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:19:34,976 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:19:34,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 23:19:35,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:35,182 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:35,285 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:19:35,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:19:35 BoogieIcfgContainer [2024-11-08 23:19:35,288 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:19:35,288 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:19:35,288 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:19:35,288 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:19:35,289 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:19:22" (3/4) ... [2024-11-08 23:19:35,291 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:19:35,292 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:19:35,292 INFO L158 Benchmark]: Toolchain (without parser) took 14118.86ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 99.8MB in the beginning and 104.6MB in the end (delta: -4.8MB). Peak memory consumption was 153.0MB. Max. memory is 16.1GB. [2024-11-08 23:19:35,292 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 121.6MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:19:35,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.68ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 128.8MB in the end (delta: -29.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 23:19:35,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.79ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 124.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:19:35,293 INFO L158 Benchmark]: Boogie Preprocessor took 98.29ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 112.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 23:19:35,293 INFO L158 Benchmark]: RCFGBuilder took 564.87ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 84.7MB in the end (delta: 27.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 23:19:35,293 INFO L158 Benchmark]: TraceAbstraction took 12959.62ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 84.2MB in the beginning and 104.6MB in the end (delta: -20.4MB). Peak memory consumption was 137.9MB. Max. memory is 16.1GB. [2024-11-08 23:19:35,294 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 325.1MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:19:35,295 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 121.6MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.68ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 128.8MB in the end (delta: -29.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.79ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 124.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.29ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 112.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 564.87ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 84.7MB in the end (delta: 27.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12959.62ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 84.2MB in the beginning and 104.6MB in the end (delta: -20.4MB). Peak memory consumption was 137.9MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 325.1MB. Free memory is still 104.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 179, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryArithmeticFLOAToperation at line 129. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 200; [L23] unsigned short int var_1_5 = 42139; [L24] unsigned short int var_1_7 = 1; [L25] double var_1_9 = 0.1; [L26] float var_1_12 = 10000000000.5; [L27] float var_1_13 = 255.6; [L28] float var_1_14 = 128.2; [L29] signed long int var_1_15 = 500; [L30] unsigned char var_1_16 = 0; [L31] unsigned char var_1_17 = 0; [L32] unsigned char var_1_18 = 0; [L33] signed char var_1_19 = -5; [L34] signed char var_1_20 = -1; [L35] signed char var_1_21 = 8; [L36] float var_1_22 = 3.75; [L37] signed short int var_1_23 = 10; [L38] unsigned long int var_1_24 = 8; [L39] unsigned char var_1_25 = 5; [L40] unsigned char var_1_26 = 50; [L41] float var_1_27 = 4.5; [L42] unsigned short int var_1_28 = 5; [L43] unsigned long int var_1_29 = 50; [L44] double var_1_30 = 3.5; [L45] unsigned char var_1_31 = 1; [L46] float last_1_var_1_12 = 10000000000.5; [L47] signed short int last_1_var_1_23 = 10; [L48] unsigned long int last_1_var_1_24 = 8; [L49] unsigned char last_1_var_1_25 = 5; [L50] unsigned long int last_1_var_1_29 = 50; [L51] unsigned char last_1_var_1_31 = 1; VAL [isInitial=0, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=42139, var_1_7=1, var_1_9=1/10] [L183] isInitial = 1 [L184] FCALL initially() [L185] int k_loop; [L186] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=42139, var_1_7=1, var_1_9=1/10] [L186] COND TRUE k_loop < 1 [L187] CALL updateLastVariables() [L171] last_1_var_1_12 = var_1_12 [L172] last_1_var_1_23 = var_1_23 [L173] last_1_var_1_24 = var_1_24 [L174] last_1_var_1_25 = var_1_25 [L175] last_1_var_1_29 = var_1_29 [L176] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=42139, var_1_7=1, var_1_9=1/10] [L187] RET updateLastVariables() [L188] CALL updateVariables() [L144] var_1_5 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_5 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L145] RET assume_abort_if_not(var_1_5 >= 32767) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L146] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L146] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L147] var_1_9 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L148] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L149] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L149] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= 0.0F && 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_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L151] RET assume_abort_if_not((var_1_13 >= 0.0F && 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_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L152] var_1_14 = __VERIFIER_nondet_float() [L153] 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_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L153] 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_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L154] var_1_17 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L155] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L156] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L156] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L157] var_1_18 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L158] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L159] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L159] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L160] var_1_20 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_20 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L161] RET assume_abort_if_not(var_1_20 >= -127) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L162] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L162] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L163] var_1_21 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L164] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L165] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L165] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L166] var_1_26 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L167] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L168] CALL assume_abort_if_not(var_1_26 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L168] RET assume_abort_if_not(var_1_26 <= 254) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L188] RET updateVariables() [L189] CALL step() [L55] unsigned short int stepLocal_1 = var_1_5; [L56] unsigned long int stepLocal_0 = (last_1_var_1_25 + last_1_var_1_23) + (last_1_var_1_29 / var_1_5); VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L57] COND FALSE !((last_1_var_1_12 / var_1_9) != last_1_var_1_12) [L76] var_1_7 = var_1_5 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L78] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L81] COND TRUE \read(var_1_17) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L82] COND FALSE !(((((var_1_29) > (var_1_5)) ? (var_1_29) : (var_1_5))) < ((((4) < 0 ) ? -(4) : (4)))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L86] var_1_19 = ((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) [L87] var_1_30 = var_1_14 [L88] var_1_31 = var_1_17 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L89] COND FALSE !(var_1_13 != 4.5f) [L96] var_1_16 = (var_1_18 || (! var_1_17)) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L98] COND TRUE var_1_16 || var_1_17 [L99] var_1_22 = ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L101] COND TRUE \read(var_1_31) [L102] var_1_25 = (4 + 8) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L106] COND TRUE var_1_13 != var_1_22 [L107] var_1_28 = var_1_25 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L111] COND FALSE !(\read(var_1_16)) [L114] var_1_1 = (((((var_1_5 - var_1_25)) < ((var_1_25 + (256 + 1)))) ? ((var_1_5 - var_1_25)) : ((var_1_25 + (256 + 1))))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L116] unsigned short int stepLocal_3 = var_1_5; VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, stepLocal_3=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L117] COND TRUE stepLocal_3 >= ((((var_1_25) < (var_1_7)) ? (var_1_25) : (var_1_7))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L118] COND TRUE ! var_1_16 [L119] var_1_15 = var_1_25 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L122] COND FALSE !(var_1_16 || var_1_18) [L125] var_1_24 = ((((2u) > (100u)) ? (2u) : (100u))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L127] signed long int stepLocal_2 = ((((-64) < (var_1_28)) ? (-64) : (var_1_28))) + (var_1_25 << 1); VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, stepLocal_2=-40, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L128] COND TRUE stepLocal_2 < var_1_7 [L129] var_1_12 = (((((var_1_13 - 128.9f)) < (var_1_14)) ? ((var_1_13 - 128.9f)) : (var_1_14))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L131] COND TRUE var_1_1 != var_1_25 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L132] COND TRUE var_1_23 >= -128 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L133] COND FALSE !(var_1_30 != ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) [L136] var_1_27 = ((((0.8f) > (var_1_13)) ? (0.8f) : (var_1_13))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=4/5, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L189] RET step() [L190] CALL, EXPR property() [L179-L180] return ((((((((((((((var_1_16 ? (var_1_1 == ((unsigned short int) (((((var_1_25 + var_1_25)) < ((var_1_5 - ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25)))))) ? ((var_1_25 + var_1_25)) : ((var_1_5 - ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))))))) : (var_1_1 == ((unsigned short int) (((((var_1_5 - var_1_25)) < ((var_1_25 + (256 + 1)))) ? ((var_1_5 - var_1_25)) : ((var_1_25 + (256 + 1)))))))) && (((last_1_var_1_12 / var_1_9) != last_1_var_1_12) ? ((var_1_9 >= last_1_var_1_12) ? (var_1_7 == ((unsigned short int) last_1_var_1_25)) : ((var_1_5 <= last_1_var_1_25) ? ((last_1_var_1_25 < ((last_1_var_1_25 + last_1_var_1_23) + (last_1_var_1_29 / var_1_5))) ? (last_1_var_1_31 ? (var_1_7 == ((unsigned short int) 5)) : (var_1_7 == ((unsigned short int) last_1_var_1_25))) : (var_1_7 == ((unsigned short int) last_1_var_1_25))) : (var_1_7 == ((unsigned short int) last_1_var_1_25)))) : (var_1_7 == ((unsigned short int) var_1_5)))) && (((((((-64) < (var_1_28)) ? (-64) : (var_1_28))) + (var_1_25 << 1)) < var_1_7) ? (var_1_12 == ((float) (((((var_1_13 - 128.9f)) < (var_1_14)) ? ((var_1_13 - 128.9f)) : (var_1_14))))) : 1)) && ((var_1_5 >= ((((var_1_25) < (var_1_7)) ? (var_1_25) : (var_1_7)))) ? ((! var_1_16) ? (var_1_15 == ((signed long int) var_1_25)) : 1) : 1)) && ((var_1_13 != 4.5f) ? (var_1_31 ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) (! 0)))) : (var_1_16 == ((unsigned char) (var_1_18 || (! var_1_17)))))) && (var_1_19 == ((signed char) ((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))) && ((var_1_16 || var_1_17) ? (var_1_22 == ((float) ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13))))) : 1)) && (var_1_17 ? ((((((var_1_29) > (var_1_5)) ? (var_1_29) : (var_1_5))) < ((((4) < 0 ) ? -(4) : (4)))) ? (var_1_23 == ((signed short int) var_1_20)) : 1) : 1)) && ((var_1_16 || var_1_18) ? (var_1_24 == ((unsigned long int) ((((last_1_var_1_24) > (var_1_25)) ? (last_1_var_1_24) : (var_1_25))))) : (var_1_24 == ((unsigned long int) ((((2u) > (100u)) ? (2u) : (100u))))))) && (var_1_31 ? (var_1_25 == ((unsigned char) (4 + 8))) : (var_1_25 == ((unsigned char) ((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))))))) && ((var_1_1 != var_1_25) ? ((var_1_23 >= -128) ? ((var_1_30 != ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) ? (var_1_27 == ((float) (var_1_13 - (99999.4f + 9.999999999125E9f)))) : (var_1_27 == ((float) ((((0.8f) > (var_1_13)) ? (0.8f) : (var_1_13)))))) : 1) : (var_1_27 == ((float) var_1_14)))) && ((var_1_13 != var_1_22) ? (var_1_28 == ((unsigned short int) var_1_25)) : (var_1_28 == ((unsigned short int) (var_1_5 - 10))))) && (var_1_18 ? (var_1_29 == ((unsigned long int) (((((var_1_7 + 100000000u)) > (var_1_26)) ? ((var_1_7 + 100000000u)) : (var_1_26))))) : 1)) && (var_1_30 == ((double) var_1_14))) && (var_1_31 == ((unsigned char) var_1_17)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=4/5, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=4/5, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=4/5, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1652 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1627 mSDsluCounter, 3082 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1838 mSDsCounter, 294 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1335 IncrementalHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 294 mSolverCounterUnsat, 1244 mSDtfsCounter, 1335 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1162 GetRequests, 1075 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=4, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 601 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 1839 NumberOfCodeBlocks, 1839 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1933 ConstructedInterpolants, 0 QuantifiedInterpolants, 6530 SizeOfPredicates, 8 NumberOfNonLiveVariables, 958 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 7827/8160 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:19:35,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.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 c7afbbb4b2e6924bc13d55806a21ab7f087433beabc76695e33c51517c3d4e0b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:19:37,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:19:37,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:19:37,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:19:37,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:19:37,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:19:37,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:19:37,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:19:37,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:19:37,859 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:19:37,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:19:37,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:19:37,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:19:37,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:19:37,861 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:19:37,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:19:37,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:19:37,865 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:19:37,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:19:37,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:19:37,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:19:37,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:19:37,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:19:37,870 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:19:37,870 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:19:37,870 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:19:37,870 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:19:37,871 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:19:37,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:19:37,872 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:19:37,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:19:37,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:19:37,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:19:37,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:19:37,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:19:37,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:19:37,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:19:37,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:19:37,874 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:19:37,874 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:19:37,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:19:37,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:19:37,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:19:37,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:19:37,875 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 -> c7afbbb4b2e6924bc13d55806a21ab7f087433beabc76695e33c51517c3d4e0b [2024-11-08 23:19:38,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:19:38,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:19:38,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:19:38,258 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:19:38,258 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:19:38,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i [2024-11-08 23:19:39,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:19:39,896 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:19:39,897 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i [2024-11-08 23:19:39,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a229fb2cd/17b8d06b320d43d6a59c78efb4606eab/FLAGf16b98253 [2024-11-08 23:19:39,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a229fb2cd/17b8d06b320d43d6a59c78efb4606eab [2024-11-08 23:19:39,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:19:39,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:19:39,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:19:39,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:19:39,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:19:39,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:19:39" (1/1) ... [2024-11-08 23:19:39,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13dfacb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:39, skipping insertion in model container [2024-11-08 23:19:39,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:19:39" (1/1) ... [2024-11-08 23:19:39,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:19:40,173 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_loopvsstraightlinecode_100-1loop_file-38.i[916,929] [2024-11-08 23:19:40,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:19:40,287 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:19:40,299 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_loopvsstraightlinecode_100-1loop_file-38.i[916,929] [2024-11-08 23:19:40,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:19:40,375 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:19:40,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:40 WrapperNode [2024-11-08 23:19:40,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:19:40,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:19:40,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:19:40,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:19:40,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:40" (1/1) ... [2024-11-08 23:19:40,404 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:40" (1/1) ... [2024-11-08 23:19:40,441 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-11-08 23:19:40,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:19:40,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:19:40,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:19:40,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:19:40,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:40" (1/1) ... [2024-11-08 23:19:40,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:40" (1/1) ... [2024-11-08 23:19:40,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:40" (1/1) ... [2024-11-08 23:19:40,496 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:19:40,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:40" (1/1) ... [2024-11-08 23:19:40,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:40" (1/1) ... [2024-11-08 23:19:40,513 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:40" (1/1) ... [2024-11-08 23:19:40,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:40" (1/1) ... [2024-11-08 23:19:40,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:40" (1/1) ... [2024-11-08 23:19:40,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:40" (1/1) ... [2024-11-08 23:19:40,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:19:40,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:19:40,536 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:19:40,536 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:19:40,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:40" (1/1) ... [2024-11-08 23:19:40,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:19:40,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:19:40,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:19:40,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:19:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:19:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:19:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:19:40,605 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:19:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:19:40,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:19:40,691 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:19:40,694 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:19:54,783 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-08 23:19:54,784 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:19:54,799 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:19:54,800 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:19:54,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:19:54 BoogieIcfgContainer [2024-11-08 23:19:54,801 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:19:54,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:19:54,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:19:54,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:19:54,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:19:39" (1/3) ... [2024-11-08 23:19:54,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12bde071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:19:54, skipping insertion in model container [2024-11-08 23:19:54,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:40" (2/3) ... [2024-11-08 23:19:54,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12bde071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:19:54, skipping insertion in model container [2024-11-08 23:19:54,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:19:54" (3/3) ... [2024-11-08 23:19:54,811 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-38.i [2024-11-08 23:19:54,825 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:19:54,825 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:19:54,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:19:54,893 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;@5f9090de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:19:54,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:19:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 50 states have (on average 1.52) internal successors, (76), 51 states have internal predecessors, (76), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:19:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:19:54,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:54,913 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:54,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:54,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:54,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1674220312, now seen corresponding path program 1 times [2024-11-08 23:19:54,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:19:54,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290292961] [2024-11-08 23:19:54,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:54,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:19:54,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:19:54,940 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:19:54,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:19:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:55,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:19:55,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:19:55,845 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-08 23:19:55,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:19:55,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:19:55,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290292961] [2024-11-08 23:19:55,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290292961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:55,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:55,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:19:55,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395735585] [2024-11-08 23:19:55,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:55,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:19:55,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:19:55,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:19:55,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:19:55,876 INFO L87 Difference]: Start difference. First operand has 69 states, 50 states have (on average 1.52) internal successors, (76), 51 states have internal predecessors, (76), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 23:19:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:55,898 INFO L93 Difference]: Finished difference Result 135 states and 229 transitions. [2024-11-08 23:19:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:19:55,900 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 113 [2024-11-08 23:19:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:55,907 INFO L225 Difference]: With dead ends: 135 [2024-11-08 23:19:55,907 INFO L226 Difference]: Without dead ends: 65 [2024-11-08 23:19:55,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:19:55,912 INFO L432 NwaCegarLoop]: 105 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, 105 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:55,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:19:55,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-08 23:19:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-08 23:19:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 47 states have internal predecessors, (69), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:19:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 101 transitions. [2024-11-08 23:19:55,948 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 101 transitions. Word has length 113 [2024-11-08 23:19:55,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:55,948 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 101 transitions. [2024-11-08 23:19:55,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 23:19:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 101 transitions. [2024-11-08 23:19:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:19:55,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:55,951 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:55,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 23:19:56,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:19:56,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:56,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2044782116, now seen corresponding path program 1 times [2024-11-08 23:19:56,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:19:56,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700569066] [2024-11-08 23:19:56,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:56,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:19:56,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:19:56,156 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:19:56,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:19:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:57,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:19:57,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:19:58,813 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 249 proven. 18 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2024-11-08 23:19:58,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:20:01,297 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 27 proven. 18 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-08 23:20:01,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:20:01,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700569066] [2024-11-08 23:20:01,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700569066] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:20:01,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:20:01,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-08 23:20:01,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997532113] [2024-11-08 23:20:01,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:20:01,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:20:01,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:20:01,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:20:01,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:20:01,304 INFO L87 Difference]: Start difference. First operand 65 states and 101 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:20:08,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:20:12,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:20:16,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:20:16,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:20:16,181 INFO L93 Difference]: Finished difference Result 135 states and 206 transitions. [2024-11-08 23:20:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:20:16,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 113 [2024-11-08 23:20:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:20:16,338 INFO L225 Difference]: With dead ends: 135 [2024-11-08 23:20:16,338 INFO L226 Difference]: Without dead ends: 73 [2024-11-08 23:20:16,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:20:16,340 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 125 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 20 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:20:16,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 199 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 104 Invalid, 3 Unknown, 0 Unchecked, 14.3s Time] [2024-11-08 23:20:16,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-08 23:20:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2024-11-08 23:20:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:20:16,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2024-11-08 23:20:16,356 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 113 [2024-11-08 23:20:16,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:20:16,356 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2024-11-08 23:20:16,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:20:16,357 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2024-11-08 23:20:16,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:20:16,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:20:16,362 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:20:16,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 23:20:16,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:20:16,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:20:16,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:20:16,564 INFO L85 PathProgramCache]: Analyzing trace with hash 50637410, now seen corresponding path program 1 times [2024-11-08 23:20:16,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:20:16,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446357753] [2024-11-08 23:20:16,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:20:16,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:20:16,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:20:16,568 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:20:16,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 23:20:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:17,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:20:17,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:20:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 243 proven. 27 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-08 23:20:20,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:20:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-08 23:20:22,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:20:22,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446357753] [2024-11-08 23:20:22,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446357753] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:20:22,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:20:22,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-08 23:20:22,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143259551] [2024-11-08 23:20:22,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:20:22,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:20:22,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:20:22,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:20:22,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:20:22,780 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 23:20:29,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:20:33,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:20:37,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:20:38,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:20:38,365 INFO L93 Difference]: Finished difference Result 155 states and 228 transitions. [2024-11-08 23:20:38,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 23:20:38,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 113 [2024-11-08 23:20:38,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:20:38,367 INFO L225 Difference]: With dead ends: 155 [2024-11-08 23:20:38,367 INFO L226 Difference]: Without dead ends: 89 [2024-11-08 23:20:38,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:20:38,370 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 111 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:20:38,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 206 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 15.1s Time] [2024-11-08 23:20:38,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-08 23:20:38,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2024-11-08 23:20:38,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 59 states have internal predecessors, (77), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 23:20:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2024-11-08 23:20:38,384 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 113 [2024-11-08 23:20:38,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:20:38,384 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2024-11-08 23:20:38,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 23:20:38,385 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2024-11-08 23:20:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 23:20:38,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:20:38,386 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:20:38,421 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-08 23:20:38,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:20:38,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:20:38,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:20:38,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1459205299, now seen corresponding path program 1 times [2024-11-08 23:20:38,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:20:38,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190087476] [2024-11-08 23:20:38,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:20:38,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:20:38,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:20:38,598 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:20:38,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 23:20:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:39,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:20:39,371 INFO L278 TraceCheckSpWp]: Computing forward predicates...