./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-42.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 c6501e0794616ec0486fa8dfdbb7418c6408937fb63a44ca47f9c4c2f7c3791b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:24:44,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:24:44,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 04:24:45,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:24:45,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:24:45,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:24:45,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:24:45,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:24:45,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:24:45,028 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:24:45,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:24:45,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:24:45,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:24:45,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:24:45,029 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:24:45,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:24:45,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:24:45,032 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:24:45,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 04:24:45,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:24:45,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:24:45,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:24:45,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:24:45,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:24:45,033 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:24:45,033 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:24:45,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:24:45,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:24:45,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:24:45,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:24:45,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:24:45,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:24:45,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:24:45,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:24:45,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:24:45,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:24:45,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 04:24:45,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 04:24:45,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:24:45,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:24:45,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:24:45,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:24:45,037 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 -> c6501e0794616ec0486fa8dfdbb7418c6408937fb63a44ca47f9c4c2f7c3791b [2024-11-20 04:24:45,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:24:45,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:24:45,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:24:45,292 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:24:45,292 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:24:45,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-42.i [2024-11-20 04:24:46,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:24:46,936 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:24:46,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-42.i [2024-11-20 04:24:46,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a81f949c4/8440cd22eeae44739a666256ba6715ee/FLAG30f10471a [2024-11-20 04:24:46,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a81f949c4/8440cd22eeae44739a666256ba6715ee [2024-11-20 04:24:46,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:24:46,973 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:24:46,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:24:46,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:24:46,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:24:46,981 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:24:46" (1/1) ... [2024-11-20 04:24:46,982 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65f051d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:46, skipping insertion in model container [2024-11-20 04:24:46,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:24:46" (1/1) ... [2024-11-20 04:24:47,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:24:47,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-42.i[919,932] [2024-11-20 04:24:47,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:24:47,245 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:24:47,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-42.i[919,932] [2024-11-20 04:24:47,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:24:47,302 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:24:47,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:47 WrapperNode [2024-11-20 04:24:47,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:24:47,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:24:47,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:24:47,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:24:47,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:47" (1/1) ... [2024-11-20 04:24:47,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:47" (1/1) ... [2024-11-20 04:24:47,404 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 207 [2024-11-20 04:24:47,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:24:47,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:24:47,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:24:47,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:24:47,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:47" (1/1) ... [2024-11-20 04:24:47,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:47" (1/1) ... [2024-11-20 04:24:47,428 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:47" (1/1) ... [2024-11-20 04:24:47,471 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 04:24:47,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:47" (1/1) ... [2024-11-20 04:24:47,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:47" (1/1) ... [2024-11-20 04:24:47,487 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:47" (1/1) ... [2024-11-20 04:24:47,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:47" (1/1) ... [2024-11-20 04:24:47,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:47" (1/1) ... [2024-11-20 04:24:47,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:47" (1/1) ... [2024-11-20 04:24:47,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:24:47,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:24:47,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:24:47,509 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:24:47,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:47" (1/1) ... [2024-11-20 04:24:47,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:24:47,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:24:47,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 04:24:47,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 04:24:47,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:24:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:24:47,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:24:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 04:24:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:24:47,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:24:47,676 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:24:47,678 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:24:47,991 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-20 04:24:47,992 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:24:48,007 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:24:48,007 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:24:48,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:24:48 BoogieIcfgContainer [2024-11-20 04:24:48,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:24:48,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:24:48,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:24:48,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:24:48,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:24:46" (1/3) ... [2024-11-20 04:24:48,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6ac160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:24:48, skipping insertion in model container [2024-11-20 04:24:48,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:24:47" (2/3) ... [2024-11-20 04:24:48,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6ac160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:24:48, skipping insertion in model container [2024-11-20 04:24:48,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:24:48" (3/3) ... [2024-11-20 04:24:48,014 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-42.i [2024-11-20 04:24:48,027 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:24:48,027 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:24:48,071 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:24:48,077 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;@7e3fd47c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:24:48,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:24:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-20 04:24:48,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 04:24:48,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:24:48,092 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:24:48,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:24:48,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:24:48,097 INFO L85 PathProgramCache]: Analyzing trace with hash -542820008, now seen corresponding path program 1 times [2024-11-20 04:24:48,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:24:48,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746370810] [2024-11-20 04:24:48,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:24:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:24:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:24:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:24:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:24:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:24:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:24:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:24:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:24:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:24:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:24:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:24:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:24:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:24:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:24:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:24:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:24:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:24:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:24:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:24:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:24:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:24:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:24:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:24:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:24:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:24:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:24:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:24:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:24:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:24:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:24:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 04:24:48,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:24:48,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746370810] [2024-11-20 04:24:48,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746370810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:24:48,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:24:48,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:24:48,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819120950] [2024-11-20 04:24:48,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:24:48,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:24:48,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:24:48,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:24:48,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:24:48,639 INFO L87 Difference]: Start difference. First operand has 89 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 04:24:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:24:48,755 INFO L93 Difference]: Finished difference Result 171 states and 305 transitions. [2024-11-20 04:24:48,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:24:48,757 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 190 [2024-11-20 04:24:48,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:24:48,765 INFO L225 Difference]: With dead ends: 171 [2024-11-20 04:24:48,766 INFO L226 Difference]: Without dead ends: 85 [2024-11-20 04:24:48,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:24:48,774 INFO L432 NwaCegarLoop]: 132 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, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:24:48,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:24:48,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-20 04:24:48,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-20 04:24:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-20 04:24:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 132 transitions. [2024-11-20 04:24:48,821 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 132 transitions. Word has length 190 [2024-11-20 04:24:48,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:24:48,821 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 132 transitions. [2024-11-20 04:24:48,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 04:24:48,823 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 132 transitions. [2024-11-20 04:24:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 04:24:48,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:24:48,825 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:24:48,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 04:24:48,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:24:48,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:24:48,826 INFO L85 PathProgramCache]: Analyzing trace with hash 986980, now seen corresponding path program 1 times [2024-11-20 04:24:48,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:24:48,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483764472] [2024-11-20 04:24:48,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:24:48,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:24:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:24:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:24:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:24:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:24:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:24:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:24:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:24:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:24:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:24:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:24:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:24:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:24:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:24:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:24:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:24:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:24:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:24:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:24:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:24:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:24:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:24:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:24:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:24:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:24:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:24:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:24:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:24:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:24:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:24:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:49,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 04:24:49,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:24:49,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483764472] [2024-11-20 04:24:49,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483764472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:24:49,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:24:49,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:24:49,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262238588] [2024-11-20 04:24:49,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:24:49,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:24:49,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:24:49,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:24:49,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:24:49,389 INFO L87 Difference]: Start difference. First operand 85 states and 132 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:24:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:24:49,550 INFO L93 Difference]: Finished difference Result 250 states and 391 transitions. [2024-11-20 04:24:49,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:24:49,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-11-20 04:24:49,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:24:49,553 INFO L225 Difference]: With dead ends: 250 [2024-11-20 04:24:49,553 INFO L226 Difference]: Without dead ends: 168 [2024-11-20 04:24:49,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:24:49,555 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 97 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:24:49,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 376 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:24:49,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-20 04:24:49,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2024-11-20 04:24:49,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 76 states have (on average 1.263157894736842) internal successors, (96), 76 states have internal predecessors, (96), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-20 04:24:49,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 212 transitions. [2024-11-20 04:24:49,575 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 212 transitions. Word has length 190 [2024-11-20 04:24:49,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:24:49,579 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 212 transitions. [2024-11-20 04:24:49,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:24:49,579 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 212 transitions. [2024-11-20 04:24:49,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:24:49,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:24:49,581 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:24:49,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 04:24:49,581 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:24:49,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:24:49,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1294190049, now seen corresponding path program 1 times [2024-11-20 04:24:49,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:24:49,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940545557] [2024-11-20 04:24:49,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:24:49,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:24:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:24:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:24:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:24:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:24:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:24:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:24:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:24:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:24:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:24:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:24:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:24:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:24:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:24:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:24:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:24:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:24:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:24:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:24:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:24:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:24:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:24:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:24:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:24:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:24:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:24:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:24:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:24:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:24:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:24:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 04:24:50,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:24:50,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940545557] [2024-11-20 04:24:50,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940545557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:24:50,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:24:50,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:24:50,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351131232] [2024-11-20 04:24:50,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:24:50,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:24:50,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:24:50,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:24:50,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:24:50,133 INFO L87 Difference]: Start difference. First operand 137 states and 212 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:24:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:24:50,539 INFO L93 Difference]: Finished difference Result 381 states and 595 transitions. [2024-11-20 04:24:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:24:50,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-20 04:24:50,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:24:50,543 INFO L225 Difference]: With dead ends: 381 [2024-11-20 04:24:50,543 INFO L226 Difference]: Without dead ends: 299 [2024-11-20 04:24:50,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:24:50,544 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 232 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 04:24:50,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 451 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 04:24:50,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-20 04:24:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 232. [2024-11-20 04:24:50,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 141 states have (on average 1.3333333333333333) internal successors, (188), 141 states have internal predecessors, (188), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-20 04:24:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 362 transitions. [2024-11-20 04:24:50,571 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 362 transitions. Word has length 191 [2024-11-20 04:24:50,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:24:50,572 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 362 transitions. [2024-11-20 04:24:50,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:24:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 362 transitions. [2024-11-20 04:24:50,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:24:50,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:24:50,574 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:24:50,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 04:24:50,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:24:50,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:24:50,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1351448351, now seen corresponding path program 1 times [2024-11-20 04:24:50,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:24:50,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808635573] [2024-11-20 04:24:50,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:24:50,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:24:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:24:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:24:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:24:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:24:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:24:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:24:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:24:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:24:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:24:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:24:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:24:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:24:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:24:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:24:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:24:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:24:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:24:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:24:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:24:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:24:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:24:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:24:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:24:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:24:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:24:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:24:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:24:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:24:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:24:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 04:24:50,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:24:50,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808635573] [2024-11-20 04:24:50,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808635573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:24:50,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:24:50,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 04:24:50,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722425230] [2024-11-20 04:24:50,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:24:50,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 04:24:50,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:24:50,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 04:24:50,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:24:50,987 INFO L87 Difference]: Start difference. First operand 232 states and 362 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:24:51,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:24:51,306 INFO L93 Difference]: Finished difference Result 769 states and 1215 transitions. [2024-11-20 04:24:51,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 04:24:51,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-20 04:24:51,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:24:51,311 INFO L225 Difference]: With dead ends: 769 [2024-11-20 04:24:51,312 INFO L226 Difference]: Without dead ends: 592 [2024-11-20 04:24:51,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 04:24:51,315 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 163 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:24:51,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 589 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 04:24:51,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-11-20 04:24:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 407. [2024-11-20 04:24:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 256 states have (on average 1.359375) internal successors, (348), 256 states have internal predecessors, (348), 145 states have call successors, (145), 5 states have call predecessors, (145), 5 states have return successors, (145), 145 states have call predecessors, (145), 145 states have call successors, (145) [2024-11-20 04:24:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 638 transitions. [2024-11-20 04:24:51,400 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 638 transitions. Word has length 191 [2024-11-20 04:24:51,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:24:51,401 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 638 transitions. [2024-11-20 04:24:51,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:24:51,402 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 638 transitions. [2024-11-20 04:24:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:24:51,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:24:51,405 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:24:51,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 04:24:51,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:24:51,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:24:51,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1485461857, now seen corresponding path program 1 times [2024-11-20 04:24:51,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:24:51,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41269686] [2024-11-20 04:24:51,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:24:51,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:24:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:24:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:24:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:24:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:24:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:24:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:24:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:24:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:24:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:24:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:24:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:24:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:24:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:24:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:24:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:24:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:24:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:24:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:24:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:24:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:24:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:24:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:24:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:24:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:24:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:24:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:24:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:24:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:24:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:24:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 04:24:51,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:24:51,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41269686] [2024-11-20 04:24:51,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41269686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:24:51,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:24:51,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:24:51,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608030397] [2024-11-20 04:24:51,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:24:51,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:24:51,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:24:51,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:24:51,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:24:51,564 INFO L87 Difference]: Start difference. First operand 407 states and 638 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:24:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:24:51,619 INFO L93 Difference]: Finished difference Result 603 states and 950 transitions. [2024-11-20 04:24:51,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:24:51,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-20 04:24:51,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:24:51,623 INFO L225 Difference]: With dead ends: 603 [2024-11-20 04:24:51,623 INFO L226 Difference]: Without dead ends: 251 [2024-11-20 04:24:51,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:24:51,624 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:24:51,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:24:51,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-20 04:24:51,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-11-20 04:24:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 160 states have (on average 1.35625) internal successors, (217), 160 states have internal predecessors, (217), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-20 04:24:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 391 transitions. [2024-11-20 04:24:51,643 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 391 transitions. Word has length 191 [2024-11-20 04:24:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:24:51,643 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 391 transitions. [2024-11-20 04:24:51,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:24:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 391 transitions. [2024-11-20 04:24:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:24:51,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:24:51,645 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:24:51,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 04:24:51,645 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:24:51,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:24:51,645 INFO L85 PathProgramCache]: Analyzing trace with hash 872619035, now seen corresponding path program 1 times [2024-11-20 04:24:51,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:24:51,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214637781] [2024-11-20 04:24:51,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:24:51,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:24:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:24:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:24:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:24:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:24:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:24:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:24:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:24:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:24:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:24:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:24:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:24:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:24:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:24:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:24:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:24:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:24:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:24:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:24:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:24:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:24:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:24:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:24:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:24:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:24:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:24:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:24:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:24:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:24:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:24:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:51,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 04:24:51,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:24:51,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214637781] [2024-11-20 04:24:51,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214637781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:24:51,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:24:51,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:24:51,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722484871] [2024-11-20 04:24:51,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:24:51,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:24:51,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:24:51,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:24:51,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:24:51,833 INFO L87 Difference]: Start difference. First operand 251 states and 391 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:24:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:24:51,852 INFO L93 Difference]: Finished difference Result 447 states and 699 transitions. [2024-11-20 04:24:51,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:24:51,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-20 04:24:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:24:51,854 INFO L225 Difference]: With dead ends: 447 [2024-11-20 04:24:51,855 INFO L226 Difference]: Without dead ends: 251 [2024-11-20 04:24:51,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:24:51,856 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:24:51,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 129 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:24:51,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-20 04:24:51,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-11-20 04:24:51,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 160 states have (on average 1.33125) internal successors, (213), 160 states have internal predecessors, (213), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-20 04:24:51,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 387 transitions. [2024-11-20 04:24:51,876 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 387 transitions. Word has length 191 [2024-11-20 04:24:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:24:51,877 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 387 transitions. [2024-11-20 04:24:51,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:24:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 387 transitions. [2024-11-20 04:24:51,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:24:51,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:24:51,879 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:24:51,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 04:24:51,879 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:24:51,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:24:51,879 INFO L85 PathProgramCache]: Analyzing trace with hash 815360733, now seen corresponding path program 1 times [2024-11-20 04:24:51,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:24:51,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980400869] [2024-11-20 04:24:51,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:24:51,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:24:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:24:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:24:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:24:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:24:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:24:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:24:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:24:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:24:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:24:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:24:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:24:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:24:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:24:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:24:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:24:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:24:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:24:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:24:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:24:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:24:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:24:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:24:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:24:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:24:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:24:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:24:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:24:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:24:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:24:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 111 refuted. 0 times theorem prover too weak. 1462 trivial. 0 not checked. [2024-11-20 04:24:52,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:24:52,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980400869] [2024-11-20 04:24:52,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980400869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:24:52,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445978844] [2024-11-20 04:24:52,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:24:52,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:24:52,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:24:52,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:24:52,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 04:24:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:52,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-20 04:24:52,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:24:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 863 proven. 111 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-11-20 04:24:53,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:24:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 114 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-11-20 04:24:54,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445978844] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:24:54,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:24:54,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 10] total 23 [2024-11-20 04:24:54,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588918276] [2024-11-20 04:24:54,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:24:54,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-20 04:24:54,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:24:54,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-20 04:24:54,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2024-11-20 04:24:54,178 INFO L87 Difference]: Start difference. First operand 251 states and 387 transitions. Second operand has 23 states, 23 states have (on average 4.913043478260869) internal successors, (113), 23 states have internal predecessors, (113), 6 states have call successors, (58), 4 states have call predecessors, (58), 9 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) [2024-11-20 04:24:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:24:56,583 INFO L93 Difference]: Finished difference Result 939 states and 1386 transitions. [2024-11-20 04:24:56,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-20 04:24:56,584 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.913043478260869) internal successors, (113), 23 states have internal predecessors, (113), 6 states have call successors, (58), 4 states have call predecessors, (58), 9 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) Word has length 191 [2024-11-20 04:24:56,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:24:56,589 INFO L225 Difference]: With dead ends: 939 [2024-11-20 04:24:56,589 INFO L226 Difference]: Without dead ends: 840 [2024-11-20 04:24:56,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 429 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1749 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1018, Invalid=4532, Unknown=0, NotChecked=0, Total=5550 [2024-11-20 04:24:56,592 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 619 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 1825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 04:24:56,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1616 Invalid, 1825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 04:24:56,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-20 04:24:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 392. [2024-11-20 04:24:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 263 states have (on average 1.3041825095057034) internal successors, (343), 263 states have internal predecessors, (343), 116 states have call successors, (116), 12 states have call predecessors, (116), 12 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-20 04:24:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 575 transitions. [2024-11-20 04:24:56,644 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 575 transitions. Word has length 191 [2024-11-20 04:24:56,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:24:56,644 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 575 transitions. [2024-11-20 04:24:56,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.913043478260869) internal successors, (113), 23 states have internal predecessors, (113), 6 states have call successors, (58), 4 states have call predecessors, (58), 9 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) [2024-11-20 04:24:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 575 transitions. [2024-11-20 04:24:56,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:24:56,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:24:56,646 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:24:56,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 04:24:56,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:24:56,847 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:24:56,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:24:56,848 INFO L85 PathProgramCache]: Analyzing trace with hash -990077601, now seen corresponding path program 1 times [2024-11-20 04:24:56,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:24:56,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288825648] [2024-11-20 04:24:56,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:24:56,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:24:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 04:24:56,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1881698188] [2024-11-20 04:24:56,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:24:56,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:24:56,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:24:56,907 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:24:56,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 04:24:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:57,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 04:24:57,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:24:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-20 04:24:57,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:24:58,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:24:58,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288825648] [2024-11-20 04:24:58,162 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 04:24:58,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881698188] [2024-11-20 04:24:58,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881698188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:24:58,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-20 04:24:58,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-11-20 04:24:58,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039461447] [2024-11-20 04:24:58,162 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-20 04:24:58,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 04:24:58,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:24:58,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 04:24:58,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-20 04:24:58,164 INFO L87 Difference]: Start difference. First operand 392 states and 575 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 04:24:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:24:58,808 INFO L93 Difference]: Finished difference Result 1247 states and 1804 transitions. [2024-11-20 04:24:58,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 04:24:58,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 191 [2024-11-20 04:24:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:24:58,813 INFO L225 Difference]: With dead ends: 1247 [2024-11-20 04:24:58,813 INFO L226 Difference]: Without dead ends: 932 [2024-11-20 04:24:58,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2024-11-20 04:24:58,815 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 243 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 04:24:58,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 791 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 04:24:58,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-11-20 04:24:58,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 735. [2024-11-20 04:24:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 500 states have (on average 1.29) internal successors, (645), 502 states have internal predecessors, (645), 207 states have call successors, (207), 27 states have call predecessors, (207), 27 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) [2024-11-20 04:24:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1059 transitions. [2024-11-20 04:24:58,875 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1059 transitions. Word has length 191 [2024-11-20 04:24:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:24:58,875 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1059 transitions. [2024-11-20 04:24:58,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 04:24:58,875 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1059 transitions. [2024-11-20 04:24:58,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:24:58,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:24:58,877 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:24:58,894 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-20 04:24:59,077 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-20 04:24:59,077 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:24:59,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:24:59,078 INFO L85 PathProgramCache]: Analyzing trace with hash -771222883, now seen corresponding path program 1 times [2024-11-20 04:24:59,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:24:59,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009421460] [2024-11-20 04:24:59,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:24:59,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:24:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 04:24:59,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1297328779] [2024-11-20 04:24:59,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:24:59,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:24:59,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:24:59,175 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:24:59,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 04:24:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:24:59,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 04:24:59,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:25:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-20 04:25:00,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:25:00,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:25:00,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009421460] [2024-11-20 04:25:00,354 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 04:25:00,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297328779] [2024-11-20 04:25:00,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297328779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:25:00,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-20 04:25:00,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-20 04:25:00,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956520861] [2024-11-20 04:25:00,355 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-20 04:25:00,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 04:25:00,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:25:00,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 04:25:00,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-20 04:25:00,357 INFO L87 Difference]: Start difference. First operand 735 states and 1059 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 04:25:00,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:25:00,939 INFO L93 Difference]: Finished difference Result 1327 states and 1913 transitions. [2024-11-20 04:25:00,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 04:25:00,939 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 191 [2024-11-20 04:25:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:25:00,949 INFO L225 Difference]: With dead ends: 1327 [2024-11-20 04:25:00,949 INFO L226 Difference]: Without dead ends: 1008 [2024-11-20 04:25:00,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2024-11-20 04:25:00,951 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 155 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 04:25:00,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 712 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 04:25:00,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2024-11-20 04:25:01,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 912. [2024-11-20 04:25:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 611 states have (on average 1.2782324058919803) internal successors, (781), 613 states have internal predecessors, (781), 265 states have call successors, (265), 35 states have call predecessors, (265), 35 states have return successors, (265), 263 states have call predecessors, (265), 265 states have call successors, (265) [2024-11-20 04:25:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1311 transitions. [2024-11-20 04:25:01,020 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1311 transitions. Word has length 191 [2024-11-20 04:25:01,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:25:01,021 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1311 transitions. [2024-11-20 04:25:01,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 04:25:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1311 transitions. [2024-11-20 04:25:01,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 04:25:01,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:25:01,023 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:25:01,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 04:25:01,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:25:01,228 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:25:01,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:25:01,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1413796365, now seen corresponding path program 1 times [2024-11-20 04:25:01,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:25:01,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842604834] [2024-11-20 04:25:01,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:25:01,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:25:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 04:25:01,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [135325939] [2024-11-20 04:25:01,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:25:01,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:25:01,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:25:01,328 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-20 04:25:01,335 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-20 04:25:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:25:01,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 04:25:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:25:01,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 04:25:01,618 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 04:25:01,619 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 04:25:01,630 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-20 04:25:01,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:25:01,823 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:25:01,989 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 04:25:01,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:25:01 BoogieIcfgContainer [2024-11-20 04:25:01,993 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 04:25:01,993 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 04:25:01,993 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 04:25:01,994 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 04:25:01,994 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:24:48" (3/4) ... [2024-11-20 04:25:01,996 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 04:25:01,997 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 04:25:01,998 INFO L158 Benchmark]: Toolchain (without parser) took 15025.43ms. Allocated memory was 174.1MB in the beginning and 492.8MB in the end (delta: 318.8MB). Free memory was 108.1MB in the beginning and 446.0MB in the end (delta: -337.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:25:01,998 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 104.9MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:25:01,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.64ms. Allocated memory is still 174.1MB. Free memory was 107.9MB in the beginning and 140.5MB in the end (delta: -32.6MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-20 04:25:01,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.52ms. Allocated memory is still 174.1MB. Free memory was 140.5MB in the beginning and 135.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 04:25:01,999 INFO L158 Benchmark]: Boogie Preprocessor took 101.56ms. Allocated memory is still 174.1MB. Free memory was 135.7MB in the beginning and 129.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 04:25:01,999 INFO L158 Benchmark]: RCFGBuilder took 499.18ms. Allocated memory is still 174.1MB. Free memory was 129.4MB in the beginning and 100.8MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-20 04:25:01,999 INFO L158 Benchmark]: TraceAbstraction took 13983.84ms. Allocated memory was 174.1MB in the beginning and 492.8MB in the end (delta: 318.8MB). Free memory was 100.1MB in the beginning and 446.0MB in the end (delta: -345.9MB). Peak memory consumption was 188.9MB. Max. memory is 16.1GB. [2024-11-20 04:25:02,000 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 492.8MB. Free memory is still 446.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:25:02,001 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.08ms. Allocated memory is still 104.9MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.64ms. Allocated memory is still 174.1MB. Free memory was 107.9MB in the beginning and 140.5MB in the end (delta: -32.6MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.52ms. Allocated memory is still 174.1MB. Free memory was 140.5MB in the beginning and 135.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.56ms. Allocated memory is still 174.1MB. Free memory was 135.7MB in the beginning and 129.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 499.18ms. Allocated memory is still 174.1MB. Free memory was 129.4MB in the beginning and 100.8MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13983.84ms. Allocated memory was 174.1MB in the beginning and 492.8MB in the end (delta: 318.8MB). Free memory was 100.1MB in the beginning and 446.0MB in the end (delta: -345.9MB). Peak memory consumption was 188.9MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 492.8MB. Free memory is still 446.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 200, overapproximation of someUnaryDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticFLOAToperation at line 116. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] unsigned char var_1_25 = 1; [L38] float var_1_26 = 500.65; [L39] signed long int var_1_27 = -8; [L40] float var_1_28 = 255.5; [L41] float var_1_29 = 7.5; [L42] float var_1_30 = 9.8; [L43] unsigned char var_1_31 = 4; [L44] unsigned char var_1_33 = 2; [L45] unsigned short int var_1_34 = 1; [L46] unsigned long int var_1_35 = 10; [L47] unsigned char var_1_36 = 10; [L48] unsigned char var_1_37 = 128; [L49] unsigned char var_1_38 = 16; [L50] unsigned char var_1_39 = 0; [L51] unsigned short int var_1_40 = 10; [L52] unsigned short int var_1_41 = 128; [L53] unsigned short int var_1_42 = 40597; [L54] signed short int last_1_var_1_1 = 16; [L55] unsigned char last_1_var_1_6 = 10; [L56] unsigned char last_1_var_1_8 = 1; [L57] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L194] last_1_var_1_1 = var_1_1 [L195] last_1_var_1_6 = var_1_6 [L196] last_1_var_1_8 = var_1_8 [L197] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L207] RET updateLastVariables() [L208] CALL updateVariables() [L147] var_1_5 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=128, var_1_8=1] [L148] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=128, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=128, var_1_8=1] [L149] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=128, var_1_8=1] [L150] var_1_7 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L151] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L152] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L153] var_1_11 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L154] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L155] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L155] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L156] var_1_12 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L157] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L158] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L158] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L159] var_1_15 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L160] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L161] var_1_16 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L162] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L163] var_1_20 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L164] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L165] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L165] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L166] var_1_25 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L167] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L168] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L169] var_1_27 = __VERIFIER_nondet_long() [L170] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L170] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L171] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L172] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L173] var_1_28 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L174] RET assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L175] var_1_29 = __VERIFIER_nondet_float() [L176] CALL assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L176] RET assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L177] var_1_33 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L178] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L179] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L179] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L180] var_1_37 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_37 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L181] RET assume_abort_if_not(var_1_37 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L182] CALL assume_abort_if_not(var_1_37 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L182] RET assume_abort_if_not(var_1_37 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L183] var_1_38 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L184] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L185] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L185] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L186] var_1_39 = __VERIFIER_nondet_uchar() [L187] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L187] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L188] CALL assume_abort_if_not(var_1_39 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L188] RET assume_abort_if_not(var_1_39 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L189] var_1_42 = __VERIFIER_nondet_ushort() [L190] CALL assume_abort_if_not(var_1_42 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L190] RET assume_abort_if_not(var_1_42 >= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L191] CALL assume_abort_if_not(var_1_42 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L191] RET assume_abort_if_not(var_1_42 <= 65534) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L208] RET updateVariables() [L209] CALL step() [L61] signed long int stepLocal_6 = last_1_var_1_1; [L62] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L63] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L64] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L67] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L72] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=201, var_1_8=1] [L75] COND TRUE var_1_5 >= -2 [L76] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=1] [L78] unsigned char stepLocal_4 = var_1_6; [L79] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=101, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=1] [L80] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=101, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=1] [L81] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L82] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=1] [L89] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=1] [L90] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=1] [L93] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=1] [L94] COND TRUE \read(var_1_19) [L95] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=1] [L101] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L102] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=1] [L103] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L110] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=0] [L112] COND TRUE var_1_19 || var_1_8 [L113] var_1_21 = ((var_1_13 > -4) || var_1_25) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=0] [L115] COND TRUE ((var_1_13 + 25) % var_1_27) < 2 [L116] var_1_26 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) + var_1_29) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=0] [L118] COND TRUE (- var_1_28) < ((((var_1_14) > (var_1_29)) ? (var_1_14) : (var_1_29))) [L119] var_1_30 = var_1_29 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=0] [L121] COND TRUE ((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) < (var_1_13)) ? (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) : (var_1_13))) <= var_1_13 [L122] var_1_31 = var_1_33 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=0] [L124] COND FALSE !(var_1_6 < ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=0] [L127] COND TRUE \read(var_1_25) [L128] var_1_35 = var_1_33 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=0] [L130] COND TRUE \read(var_1_25) [L131] var_1_36 = (var_1_37 - var_1_38) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=0] [L135] COND TRUE (- var_1_17) != var_1_17 [L136] var_1_40 = var_1_39 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=0] [L138] COND FALSE !(var_1_33 <= (~ var_1_13)) [L143] var_1_41 = var_1_1 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=101, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=0] [L209] RET step() [L210] CALL, EXPR property() [L200-L201] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=101, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=0] [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=101, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=101, var_1_42=32767, var_1_5=8, var_1_6=101, var_1_7=201, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 10, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1601 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1570 mSDsluCounter, 5044 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3562 mSDsCounter, 705 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2736 IncrementalHoareTripleChecker+Invalid, 3441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 705 mSolverCounterUnsat, 1482 mSDtfsCounter, 2736 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1651 GetRequests, 1524 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1863 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=912occurred in iteration=9, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 1024 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 2674 NumberOfCodeBlocks, 2674 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2088 ConstructedInterpolants, 1 QuantifiedInterpolants, 9085 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1359 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 17372/17864 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 04:25:02,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-42.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 c6501e0794616ec0486fa8dfdbb7418c6408937fb63a44ca47f9c4c2f7c3791b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:25:04,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:25:04,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 04:25:04,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:25:04,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:25:04,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:25:04,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:25:04,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:25:04,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:25:04,473 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:25:04,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:25:04,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:25:04,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:25:04,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:25:04,476 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:25:04,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:25:04,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:25:04,477 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:25:04,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:25:04,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:25:04,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:25:04,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:25:04,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:25:04,482 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 04:25:04,482 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 04:25:04,482 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:25:04,482 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 04:25:04,482 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:25:04,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:25:04,483 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:25:04,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:25:04,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:25:04,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:25:04,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:25:04,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:25:04,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:25:04,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:25:04,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:25:04,484 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 04:25:04,484 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 04:25:04,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:25:04,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:25:04,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:25:04,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:25:04,486 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 -> c6501e0794616ec0486fa8dfdbb7418c6408937fb63a44ca47f9c4c2f7c3791b [2024-11-20 04:25:04,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:25:04,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:25:04,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:25:04,836 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:25:04,837 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:25:04,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-42.i [2024-11-20 04:25:06,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:25:06,654 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:25:06,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-42.i [2024-11-20 04:25:06,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59976a15f/57abc0acf23f4edbbe3f922119cb763b/FLAG66705d05c [2024-11-20 04:25:06,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59976a15f/57abc0acf23f4edbbe3f922119cb763b [2024-11-20 04:25:06,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:25:06,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:25:06,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:25:06,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:25:06,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:25:06,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:25:06" (1/1) ... [2024-11-20 04:25:06,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ebafe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:25:06, skipping insertion in model container [2024-11-20 04:25:06,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:25:06" (1/1) ... [2024-11-20 04:25:07,022 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:25:07,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_fillercode_fillercodestructure_filler-pe-co_file-42.i[919,932] [2024-11-20 04:25:07,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:25:07,255 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:25:07,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-42.i[919,932] [2024-11-20 04:25:07,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:25:07,307 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:25:07,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:25:07 WrapperNode [2024-11-20 04:25:07,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:25:07,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:25:07,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:25:07,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:25:07,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:25:07" (1/1) ... [2024-11-20 04:25:07,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:25:07" (1/1) ... [2024-11-20 04:25:07,357 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-11-20 04:25:07,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:25:07,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:25:07,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:25:07,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:25:07,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:25:07" (1/1) ... [2024-11-20 04:25:07,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:25:07" (1/1) ... [2024-11-20 04:25:07,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:25:07" (1/1) ... [2024-11-20 04:25:07,396 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 04:25:07,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:25:07" (1/1) ... [2024-11-20 04:25:07,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:25:07" (1/1) ... [2024-11-20 04:25:07,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:25:07" (1/1) ... [2024-11-20 04:25:07,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:25:07" (1/1) ... [2024-11-20 04:25:07,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:25:07" (1/1) ... [2024-11-20 04:25:07,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:25:07" (1/1) ... [2024-11-20 04:25:07,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:25:07,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:25:07,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:25:07,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:25:07,427 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:25:07" (1/1) ... [2024-11-20 04:25:07,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:25:07,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:25:07,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 04:25:07,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 04:25:07,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:25:07,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 04:25:07,516 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:25:07,516 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:25:07,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:25:07,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:25:07,604 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:25:07,606 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:25:08,354 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-20 04:25:08,354 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:25:08,365 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:25:08,365 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:25:08,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:25:08 BoogieIcfgContainer [2024-11-20 04:25:08,366 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:25:08,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:25:08,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:25:08,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:25:08,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:25:06" (1/3) ... [2024-11-20 04:25:08,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfe2502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:25:08, skipping insertion in model container [2024-11-20 04:25:08,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:25:07" (2/3) ... [2024-11-20 04:25:08,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfe2502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:25:08, skipping insertion in model container [2024-11-20 04:25:08,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:25:08" (3/3) ... [2024-11-20 04:25:08,372 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-42.i [2024-11-20 04:25:08,385 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:25:08,386 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:25:08,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:25:08,444 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;@5a45eab5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:25:08,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:25:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-20 04:25:08,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 04:25:08,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:25:08,463 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:25:08,463 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:25:08,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:25:08,469 INFO L85 PathProgramCache]: Analyzing trace with hash -542820008, now seen corresponding path program 1 times [2024-11-20 04:25:08,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:25:08,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094087506] [2024-11-20 04:25:08,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:25:08,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:25:08,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:25:08,490 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:25:08,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 04:25:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:25:08,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 04:25:08,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:25:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-11-20 04:25:08,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:25:08,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:25:08,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094087506] [2024-11-20 04:25:08,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094087506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:25:08,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:25:08,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:25:08,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86765295] [2024-11-20 04:25:08,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:25:08,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:25:08,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:25:08,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:25:08,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:25:08,979 INFO L87 Difference]: Start difference. First operand has 89 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 04:25:09,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:25:09,019 INFO L93 Difference]: Finished difference Result 171 states and 305 transitions. [2024-11-20 04:25:09,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:25:09,022 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 190 [2024-11-20 04:25:09,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:25:09,029 INFO L225 Difference]: With dead ends: 171 [2024-11-20 04:25:09,030 INFO L226 Difference]: Without dead ends: 85 [2024-11-20 04:25:09,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:25:09,041 INFO L432 NwaCegarLoop]: 132 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, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:25:09,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:25:09,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-20 04:25:09,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-20 04:25:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-20 04:25:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 132 transitions. [2024-11-20 04:25:09,115 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 132 transitions. Word has length 190 [2024-11-20 04:25:09,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:25:09,115 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 132 transitions. [2024-11-20 04:25:09,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 04:25:09,116 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 132 transitions. [2024-11-20 04:25:09,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 04:25:09,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:25:09,123 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:25:09,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 04:25:09,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:25:09,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:25:09,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:25:09,330 INFO L85 PathProgramCache]: Analyzing trace with hash 986980, now seen corresponding path program 1 times [2024-11-20 04:25:09,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:25:09,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318694378] [2024-11-20 04:25:09,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:25:09,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:25:09,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:25:09,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:25:09,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 04:25:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:25:09,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 04:25:09,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:25:10,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 04:25:10,021 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:25:10,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:25:10,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318694378] [2024-11-20 04:25:10,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318694378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:25:10,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:25:10,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:25:10,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341310571] [2024-11-20 04:25:10,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:25:10,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:25:10,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:25:10,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:25:10,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:25:10,026 INFO L87 Difference]: Start difference. First operand 85 states and 132 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:25:10,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:25:10,471 INFO L93 Difference]: Finished difference Result 250 states and 391 transitions. [2024-11-20 04:25:10,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:25:10,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-11-20 04:25:10,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:25:10,483 INFO L225 Difference]: With dead ends: 250 [2024-11-20 04:25:10,484 INFO L226 Difference]: Without dead ends: 168 [2024-11-20 04:25:10,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:25:10,486 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 94 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 04:25:10,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 376 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 04:25:10,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-20 04:25:10,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2024-11-20 04:25:10,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 76 states have (on average 1.263157894736842) internal successors, (96), 76 states have internal predecessors, (96), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-20 04:25:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 212 transitions. [2024-11-20 04:25:10,521 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 212 transitions. Word has length 190 [2024-11-20 04:25:10,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:25:10,521 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 212 transitions. [2024-11-20 04:25:10,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:25:10,522 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 212 transitions. [2024-11-20 04:25:10,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:25:10,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:25:10,523 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:25:10,540 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-20 04:25:10,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:25:10,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:25:10,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:25:10,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1294190049, now seen corresponding path program 1 times [2024-11-20 04:25:10,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:25:10,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287116553] [2024-11-20 04:25:10,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:25:10,733 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:25:10,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:25:10,736 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:25:10,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 04:25:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:25:11,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 04:25:11,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:25:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 04:25:11,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:25:11,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:25:11,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287116553] [2024-11-20 04:25:11,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287116553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:25:11,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:25:11,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:25:11,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949265547] [2024-11-20 04:25:11,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:25:11,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 04:25:11,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:25:11,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 04:25:11,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:25:11,848 INFO L87 Difference]: Start difference. First operand 137 states and 212 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:25:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:25:12,788 INFO L93 Difference]: Finished difference Result 375 states and 591 transitions. [2024-11-20 04:25:12,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 04:25:12,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-20 04:25:12,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:25:12,797 INFO L225 Difference]: With dead ends: 375 [2024-11-20 04:25:12,797 INFO L226 Difference]: Without dead ends: 293 [2024-11-20 04:25:12,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 04:25:12,799 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 160 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 04:25:12,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 584 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 04:25:12,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-20 04:25:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 217. [2024-11-20 04:25:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 126 states have (on average 1.3095238095238095) internal successors, (165), 126 states have internal predecessors, (165), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-20 04:25:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 339 transitions. [2024-11-20 04:25:12,834 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 339 transitions. Word has length 191 [2024-11-20 04:25:12,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:25:12,835 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 339 transitions. [2024-11-20 04:25:12,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:25:12,835 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 339 transitions. [2024-11-20 04:25:12,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:25:12,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:25:12,837 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:25:12,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-20 04:25:13,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:25:13,039 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:25:13,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:25:13,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1428203555, now seen corresponding path program 1 times [2024-11-20 04:25:13,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:25:13,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859966847] [2024-11-20 04:25:13,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:25:13,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:25:13,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:25:13,043 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:25:13,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 04:25:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:25:13,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 04:25:13,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:25:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 04:25:13,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:25:13,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:25:13,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859966847] [2024-11-20 04:25:13,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859966847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:25:13,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:25:13,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:25:13,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461615437] [2024-11-20 04:25:13,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:25:13,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:25:13,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:25:13,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:25:13,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:25:13,389 INFO L87 Difference]: Start difference. First operand 217 states and 339 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:25:13,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:25:13,599 INFO L93 Difference]: Finished difference Result 379 states and 595 transitions. [2024-11-20 04:25:13,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:25:13,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-20 04:25:13,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:25:13,610 INFO L225 Difference]: With dead ends: 379 [2024-11-20 04:25:13,610 INFO L226 Difference]: Without dead ends: 217 [2024-11-20 04:25:13,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:25:13,611 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:25:13,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 04:25:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-20 04:25:13,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-11-20 04:25:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 126 states have (on average 1.2936507936507937) internal successors, (163), 126 states have internal predecessors, (163), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-20 04:25:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 337 transitions. [2024-11-20 04:25:13,637 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 337 transitions. Word has length 191 [2024-11-20 04:25:13,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:25:13,638 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 337 transitions. [2024-11-20 04:25:13,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:25:13,639 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 337 transitions. [2024-11-20 04:25:13,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:25:13,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:25:13,641 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:25:13,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-20 04:25:13,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:25:13,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:25:13,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:25:13,847 INFO L85 PathProgramCache]: Analyzing trace with hash 872619035, now seen corresponding path program 1 times [2024-11-20 04:25:13,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:25:13,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767834346] [2024-11-20 04:25:13,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:25:13,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:25:13,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:25:13,850 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:25:13,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 04:25:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:25:14,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 04:25:14,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:25:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 863 proven. 111 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-11-20 04:25:14,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:25:15,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 114 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-11-20 04:25:15,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:25:15,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767834346] [2024-11-20 04:25:15,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767834346] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:25:15,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 04:25:15,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-20 04:25:15,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095599595] [2024-11-20 04:25:15,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 04:25:15,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 04:25:15,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:25:15,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 04:25:15,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-20 04:25:15,027 INFO L87 Difference]: Start difference. First operand 217 states and 337 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 3 states have call successors, (50), 3 states have call predecessors, (50), 7 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-20 04:25:16,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:25:16,029 INFO L93 Difference]: Finished difference Result 446 states and 654 transitions. [2024-11-20 04:25:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-20 04:25:16,030 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 3 states have call successors, (50), 3 states have call predecessors, (50), 7 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 191 [2024-11-20 04:25:16,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:25:16,033 INFO L225 Difference]: With dead ends: 446 [2024-11-20 04:25:16,033 INFO L226 Difference]: Without dead ends: 364 [2024-11-20 04:25:16,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-11-20 04:25:16,038 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 276 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 04:25:16,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 596 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 04:25:16,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-20 04:25:16,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 338. [2024-11-20 04:25:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 209 states have (on average 1.277511961722488) internal successors, (267), 209 states have internal predecessors, (267), 116 states have call successors, (116), 12 states have call predecessors, (116), 12 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-20 04:25:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 499 transitions. [2024-11-20 04:25:16,072 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 499 transitions. Word has length 191 [2024-11-20 04:25:16,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:25:16,073 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 499 transitions. [2024-11-20 04:25:16,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 3 states have call successors, (50), 3 states have call predecessors, (50), 7 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-20 04:25:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 499 transitions. [2024-11-20 04:25:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:25:16,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:25:16,075 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:25:16,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-20 04:25:16,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:25:16,276 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:25:16,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:25:16,276 INFO L85 PathProgramCache]: Analyzing trace with hash -932819299, now seen corresponding path program 1 times [2024-11-20 04:25:16,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:25:16,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373462792] [2024-11-20 04:25:16,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:25:16,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:25:16,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:25:16,279 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:25:16,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 04:25:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:25:16,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 04:25:16,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:25:16,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 04:25:16,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:25:16,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:25:16,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373462792] [2024-11-20 04:25:16,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373462792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:25:16,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:25:16,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:25:16,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835101353] [2024-11-20 04:25:16,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:25:16,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:25:16,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:25:16,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:25:16,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:25:16,774 INFO L87 Difference]: Start difference. First operand 338 states and 499 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:25:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:25:16,857 INFO L93 Difference]: Finished difference Result 603 states and 894 transitions. [2024-11-20 04:25:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:25:16,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-20 04:25:16,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:25:16,870 INFO L225 Difference]: With dead ends: 603 [2024-11-20 04:25:16,870 INFO L226 Difference]: Without dead ends: 338 [2024-11-20 04:25:16,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:25:16,873 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:25:16,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 128 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:25:16,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-20 04:25:16,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2024-11-20 04:25:16,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 209 states have (on average 1.263157894736842) internal successors, (264), 209 states have internal predecessors, (264), 116 states have call successors, (116), 12 states have call predecessors, (116), 12 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-20 04:25:16,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 496 transitions. [2024-11-20 04:25:16,927 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 496 transitions. Word has length 191 [2024-11-20 04:25:16,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:25:16,929 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 496 transitions. [2024-11-20 04:25:16,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:25:16,932 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 496 transitions. [2024-11-20 04:25:16,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:25:16,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:25:16,933 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:25:16,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 04:25:17,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:25:17,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:25:17,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:25:17,135 INFO L85 PathProgramCache]: Analyzing trace with hash -990077601, now seen corresponding path program 1 times [2024-11-20 04:25:17,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:25:17,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342160260] [2024-11-20 04:25:17,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:25:17,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:25:17,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:25:17,138 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:25:17,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 04:25:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:25:17,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 04:25:17,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:25:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-20 04:25:18,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:25:18,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:25:18,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342160260] [2024-11-20 04:25:18,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342160260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:25:18,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1753030114] [2024-11-20 04:25:18,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:25:18,365 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 04:25:18,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 04:25:18,368 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 04:25:18,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-20 04:25:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:25:19,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 04:25:19,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:25:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 04:25:19,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:25:19,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1753030114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:25:19,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 04:25:19,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-20 04:25:19,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302574816] [2024-11-20 04:25:19,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:25:19,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 04:25:19,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:25:19,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 04:25:19,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-20 04:25:19,556 INFO L87 Difference]: Start difference. First operand 338 states and 496 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:25:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:25:21,950 INFO L93 Difference]: Finished difference Result 1053 states and 1541 transitions. [2024-11-20 04:25:21,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 04:25:21,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-20 04:25:21,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:25:21,965 INFO L225 Difference]: With dead ends: 1053 [2024-11-20 04:25:21,965 INFO L226 Difference]: Without dead ends: 788 [2024-11-20 04:25:21,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-20 04:25:21,970 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 189 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:25:21,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 623 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-20 04:25:21,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-11-20 04:25:22,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 665. [2024-11-20 04:25:22,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 434 states have (on average 1.2764976958525345) internal successors, (554), 436 states have internal predecessors, (554), 207 states have call successors, (207), 23 states have call predecessors, (207), 23 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) [2024-11-20 04:25:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 968 transitions. [2024-11-20 04:25:22,117 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 968 transitions. Word has length 191 [2024-11-20 04:25:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:25:22,122 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 968 transitions. [2024-11-20 04:25:22,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:25:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 968 transitions. [2024-11-20 04:25:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 04:25:22,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:25:22,125 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:25:22,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-11-20 04:25:22,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-20 04:25:22,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:25:22,532 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:25:22,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:25:22,533 INFO L85 PathProgramCache]: Analyzing trace with hash -771222883, now seen corresponding path program 1 times [2024-11-20 04:25:22,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:25:22,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206113080] [2024-11-20 04:25:22,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:25:22,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:25:22,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:25:22,536 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:25:22,537 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 (10)] Waiting until timeout for monitored process [2024-11-20 04:25:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:25:22,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 04:25:22,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:25:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-20 04:25:23,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:25:23,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:25:23,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206113080] [2024-11-20 04:25:23,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206113080] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:25:23,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2048290876] [2024-11-20 04:25:23,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:25:23,807 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 04:25:23,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 04:25:23,809 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 04:25:23,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-20 04:25:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:25:24,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 04:25:24,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:25:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 04:25:25,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:25:25,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2048290876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:25:25,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 04:25:25,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-20 04:25:25,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646075441] [2024-11-20 04:25:25,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:25:25,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 04:25:25,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:25:25,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 04:25:25,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-20 04:25:25,303 INFO L87 Difference]: Start difference. First operand 665 states and 968 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:25:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:25:27,577 INFO L93 Difference]: Finished difference Result 1179 states and 1723 transitions. [2024-11-20 04:25:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 04:25:27,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-20 04:25:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:25:27,589 INFO L225 Difference]: With dead ends: 1179 [2024-11-20 04:25:27,589 INFO L226 Difference]: Without dead ends: 910 [2024-11-20 04:25:27,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-20 04:25:27,590 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 106 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:25:27,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 534 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-20 04:25:27,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-11-20 04:25:27,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 838. [2024-11-20 04:25:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 543 states have (on average 1.2688766114180479) internal successors, (689), 545 states have internal predecessors, (689), 265 states have call successors, (265), 29 states have call predecessors, (265), 29 states have return successors, (265), 263 states have call predecessors, (265), 265 states have call successors, (265) [2024-11-20 04:25:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1219 transitions. [2024-11-20 04:25:27,644 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1219 transitions. Word has length 191 [2024-11-20 04:25:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:25:27,645 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1219 transitions. [2024-11-20 04:25:27,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-20 04:25:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1219 transitions. [2024-11-20 04:25:27,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 04:25:27,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:25:27,647 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:25:27,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-20 04:25:27,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-20 04:25:28,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:25:28,053 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:25:28,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:25:28,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1413796365, now seen corresponding path program 1 times [2024-11-20 04:25:28,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:25:28,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692920668] [2024-11-20 04:25:28,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:25:28,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:25:28,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:25:28,057 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:25:28,058 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 (12)] Waiting until timeout for monitored process [2024-11-20 04:25:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:25:28,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-20 04:25:28,331 INFO L278 TraceCheckSpWp]: Computing forward predicates...