./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.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 e1856ea979a515682843ea065e3d41725035a700c47302906a364d3e5d5e532f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:24:33,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:24:34,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:24:34,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:24:34,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:24:34,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:24:34,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:24:34,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:24:34,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:24:34,076 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:24:34,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:24:34,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:24:34,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:24:34,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:24:34,079 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:24:34,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:24:34,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:24:34,080 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:24:34,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:24:34,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:24:34,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:24:34,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:24:34,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:24:34,082 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:24:34,082 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:24:34,082 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:24:34,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:24:34,083 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:24:34,083 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:24:34,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:24:34,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:24:34,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:24:34,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:24:34,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:24:34,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:24:34,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:24:34,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:24:34,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:24:34,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:24:34,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:24:34,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:24:34,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:24:34,088 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 -> e1856ea979a515682843ea065e3d41725035a700c47302906a364d3e5d5e532f [2024-11-08 20:24:34,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:24:34,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:24:34,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:24:34,348 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:24:34,348 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:24:34,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2024-11-08 20:24:35,775 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:24:35,970 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:24:35,971 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2024-11-08 20:24:35,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55b686875/65ffc995ee5d457bb8dc6687aa40f76a/FLAGb1b25b83c [2024-11-08 20:24:36,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55b686875/65ffc995ee5d457bb8dc6687aa40f76a [2024-11-08 20:24:36,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:24:36,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:24:36,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:24:36,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:24:36,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:24:36,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:24:36" (1/1) ... [2024-11-08 20:24:36,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a5b591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:36, skipping insertion in model container [2024-11-08 20:24:36,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:24:36" (1/1) ... [2024-11-08 20:24:36,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:24:36,548 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_fillercodesize_ps-cn-10_file-84.i[915,928] [2024-11-08 20:24:36,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:24:36,620 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:24:36,630 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_fillercodesize_ps-cn-10_file-84.i[915,928] [2024-11-08 20:24:36,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:24:36,694 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:24:36,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:36 WrapperNode [2024-11-08 20:24:36,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:24:36,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:24:36,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:24:36,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:24:36,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:36" (1/1) ... [2024-11-08 20:24:36,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:36" (1/1) ... [2024-11-08 20:24:36,756 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 232 [2024-11-08 20:24:36,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:24:36,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:24:36,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:24:36,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:24:36,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:36" (1/1) ... [2024-11-08 20:24:36,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:36" (1/1) ... [2024-11-08 20:24:36,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:36" (1/1) ... [2024-11-08 20:24:36,801 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:24:36,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:36" (1/1) ... [2024-11-08 20:24:36,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:36" (1/1) ... [2024-11-08 20:24:36,816 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:36" (1/1) ... [2024-11-08 20:24:36,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:36" (1/1) ... [2024-11-08 20:24:36,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:36" (1/1) ... [2024-11-08 20:24:36,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:36" (1/1) ... [2024-11-08 20:24:36,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:24:36,840 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:24:36,841 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:24:36,841 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:24:36,842 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:36" (1/1) ... [2024-11-08 20:24:36,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:24:36,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:24:36,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:24:36,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:24:36,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:24:36,923 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:24:36,924 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:24:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:24:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:24:36,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:24:37,032 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:24:37,034 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:24:37,456 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-08 20:24:37,457 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:24:37,472 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:24:37,473 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:24:37,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:24:37 BoogieIcfgContainer [2024-11-08 20:24:37,473 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:24:37,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:24:37,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:24:37,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:24:37,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:24:36" (1/3) ... [2024-11-08 20:24:37,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173551fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:24:37, skipping insertion in model container [2024-11-08 20:24:37,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:36" (2/3) ... [2024-11-08 20:24:37,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173551fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:24:37, skipping insertion in model container [2024-11-08 20:24:37,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:24:37" (3/3) ... [2024-11-08 20:24:37,482 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2024-11-08 20:24:37,495 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:24:37,495 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:24:37,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:24:37,554 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;@617236cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:24:37,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:24:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 66 states have internal predecessors, (90), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:24:37,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 20:24:37,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:37,578 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:24:37,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:37,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:37,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1185775820, now seen corresponding path program 1 times [2024-11-08 20:24:37,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:24:37,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465135612] [2024-11-08 20:24:37,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:37,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:24:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:37,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:24:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:37,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:24:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:37,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:24:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:37,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:24:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:37,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:24:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:37,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:24:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:37,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:24:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:37,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:24:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:24:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:24:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:24:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:24:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:24:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:24:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:24:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:24:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:24:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:24:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:24:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:24:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:24:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:24:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 20:24:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 20:24:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 20:24:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 20:24:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 20:24:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 20:24:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 20:24:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 20:24:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 20:24:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:24:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-08 20:24:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:24:38,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:24:38,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465135612] [2024-11-08 20:24:38,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465135612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:24:38,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:24:38,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:24:38,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568680352] [2024-11-08 20:24:38,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:24:38,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:24:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:24:38,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:24:38,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:24:38,157 INFO L87 Difference]: Start difference. First operand has 101 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 66 states have internal predecessors, (90), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:24:38,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:24:38,201 INFO L93 Difference]: Finished difference Result 195 states and 339 transitions. [2024-11-08 20:24:38,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:24:38,205 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 208 [2024-11-08 20:24:38,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:24:38,212 INFO L225 Difference]: With dead ends: 195 [2024-11-08 20:24:38,212 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 20:24:38,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:24:38,220 INFO L432 NwaCegarLoop]: 149 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, 149 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:24:38,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:24:38,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 20:24:38,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-08 20:24:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:24:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 149 transitions. [2024-11-08 20:24:38,275 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 149 transitions. Word has length 208 [2024-11-08 20:24:38,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:24:38,275 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 149 transitions. [2024-11-08 20:24:38,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:24:38,276 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 149 transitions. [2024-11-08 20:24:38,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 20:24:38,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:38,280 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:24:38,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:24:38,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:38,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:38,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1745774514, now seen corresponding path program 1 times [2024-11-08 20:24:38,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:24:38,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100875737] [2024-11-08 20:24:38,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:38,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:24:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:24:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:24:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:24:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:24:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:24:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:24:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:24:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:24:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:24:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:24:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:24:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:24:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:24:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:24:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:24:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:24:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:24:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:24:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:24:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:24:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:24:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:24:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 20:24:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 20:24:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 20:24:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 20:24:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 20:24:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 20:24:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 20:24:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 20:24:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 20:24:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:24:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-08 20:24:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:38,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:24:38,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:24:38,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100875737] [2024-11-08 20:24:38,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100875737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:24:38,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:24:38,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:24:38,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024547351] [2024-11-08 20:24:38,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:24:38,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:24:38,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:24:38,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:24:38,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:24:38,819 INFO L87 Difference]: Start difference. First operand 97 states and 149 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:24:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:24:38,860 INFO L93 Difference]: Finished difference Result 191 states and 295 transitions. [2024-11-08 20:24:38,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:24:38,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-11-08 20:24:38,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:24:38,864 INFO L225 Difference]: With dead ends: 191 [2024-11-08 20:24:38,866 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 20:24:38,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:24:38,870 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 146 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:24:38,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 145 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:24:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 20:24:38,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-08 20:24:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:24:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 148 transitions. [2024-11-08 20:24:38,892 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 148 transitions. Word has length 208 [2024-11-08 20:24:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:24:38,895 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 148 transitions. [2024-11-08 20:24:38,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:24:38,896 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 148 transitions. [2024-11-08 20:24:38,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 20:24:38,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:38,902 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:24:38,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:24:38,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:38,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:38,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1487609076, now seen corresponding path program 1 times [2024-11-08 20:24:38,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:24:38,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524203932] [2024-11-08 20:24:38,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:38,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:24:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:24:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:24:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:24:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:24:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:24:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:24:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:24:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:24:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:24:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:24:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:24:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:24:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:24:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:24:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:24:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:24:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:24:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:24:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:24:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:24:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:24:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:24:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 20:24:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 20:24:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 20:24:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 20:24:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 20:24:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 20:24:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 20:24:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 20:24:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 20:24:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:24:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-08 20:24:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:24:42,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:24:42,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524203932] [2024-11-08 20:24:42,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524203932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:24:42,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:24:42,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 20:24:42,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583650007] [2024-11-08 20:24:42,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:24:42,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 20:24:42,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:24:42,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 20:24:42,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:24:42,532 INFO L87 Difference]: Start difference. First operand 97 states and 148 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:24:43,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:24:43,286 INFO L93 Difference]: Finished difference Result 226 states and 339 transitions. [2024-11-08 20:24:43,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 20:24:43,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-11-08 20:24:43,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:24:43,290 INFO L225 Difference]: With dead ends: 226 [2024-11-08 20:24:43,290 INFO L226 Difference]: Without dead ends: 132 [2024-11-08 20:24:43,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:24:43,292 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 41 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 20:24:43,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 609 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 20:24:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-08 20:24:43,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2024-11-08 20:24:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 90 states have internal predecessors, (117), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-08 20:24:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2024-11-08 20:24:43,309 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 208 [2024-11-08 20:24:43,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:24:43,310 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2024-11-08 20:24:43,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:24:43,311 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2024-11-08 20:24:43,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 20:24:43,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:43,314 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:24:43,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:24:43,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:43,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:43,315 INFO L85 PathProgramCache]: Analyzing trace with hash 672079064, now seen corresponding path program 1 times [2024-11-08 20:24:43,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:24:43,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719873542] [2024-11-08 20:24:43,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:43,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:24:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:24:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:24:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:24:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:24:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:24:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:24:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:24:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:24:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:24:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:24:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:24:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:24:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:24:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:24:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:24:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:24:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:24:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:24:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:24:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:24:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:24:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:24:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 20:24:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 20:24:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 20:24:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 20:24:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 20:24:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 20:24:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 20:24:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 20:24:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 20:24:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:24:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-08 20:24:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:24:44,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:24:44,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719873542] [2024-11-08 20:24:44,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719873542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:24:44,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:24:44,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 20:24:44,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728583200] [2024-11-08 20:24:44,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:24:44,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 20:24:44,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:24:44,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 20:24:44,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:24:44,409 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:24:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:24:44,755 INFO L93 Difference]: Finished difference Result 287 states and 420 transitions. [2024-11-08 20:24:44,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 20:24:44,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-08 20:24:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:24:44,762 INFO L225 Difference]: With dead ends: 287 [2024-11-08 20:24:44,762 INFO L226 Difference]: Without dead ends: 161 [2024-11-08 20:24:44,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:24:44,765 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 42 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:24:44,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 690 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:24:44,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-08 20:24:44,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2024-11-08 20:24:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 115 states have (on average 1.3130434782608695) internal successors, (151), 117 states have internal predecessors, (151), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 20:24:44,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 229 transitions. [2024-11-08 20:24:44,795 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 229 transitions. Word has length 209 [2024-11-08 20:24:44,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:24:44,797 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 229 transitions. [2024-11-08 20:24:44,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:24:44,797 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 229 transitions. [2024-11-08 20:24:44,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 20:24:44,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:44,799 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:24:44,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 20:24:44,800 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:44,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:44,800 INFO L85 PathProgramCache]: Analyzing trace with hash -339038186, now seen corresponding path program 1 times [2024-11-08 20:24:44,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:24:44,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622164670] [2024-11-08 20:24:44,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:44,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:24:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:24:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:24:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:24:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:24:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:24:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:24:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:24:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:24:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:24:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:24:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:24:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:24:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:24:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:24:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:24:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:24:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:24:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:24:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:24:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:24:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:24:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:24:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 20:24:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 20:24:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 20:24:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 20:24:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 20:24:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 20:24:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 20:24:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 20:24:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 20:24:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:24:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-08 20:24:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:24:45,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:24:45,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622164670] [2024-11-08 20:24:45,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622164670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:24:45,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:24:45,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 20:24:45,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100545600] [2024-11-08 20:24:45,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:24:45,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 20:24:45,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:24:45,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 20:24:45,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:24:45,421 INFO L87 Difference]: Start difference. First operand 158 states and 229 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:24:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:24:45,690 INFO L93 Difference]: Finished difference Result 329 states and 470 transitions. [2024-11-08 20:24:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 20:24:45,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-08 20:24:45,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:24:45,693 INFO L225 Difference]: With dead ends: 329 [2024-11-08 20:24:45,693 INFO L226 Difference]: Without dead ends: 174 [2024-11-08 20:24:45,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:24:45,694 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 44 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:24:45,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 654 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:24:45,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-08 20:24:45,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 141. [2024-11-08 20:24:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 97 states have (on average 1.2783505154639174) internal successors, (124), 99 states have internal predecessors, (124), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 20:24:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 202 transitions. [2024-11-08 20:24:45,713 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 202 transitions. Word has length 209 [2024-11-08 20:24:45,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:24:45,714 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 202 transitions. [2024-11-08 20:24:45,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:24:45,714 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 202 transitions. [2024-11-08 20:24:45,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 20:24:45,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:45,716 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:24:45,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 20:24:45,717 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:45,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:45,717 INFO L85 PathProgramCache]: Analyzing trace with hash 422623527, now seen corresponding path program 1 times [2024-11-08 20:24:45,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:24:45,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605832669] [2024-11-08 20:24:45,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:45,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:24:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:24:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:24:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:24:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:24:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:24:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:24:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:24:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:24:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:24:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:24:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:24:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:24:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:24:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:24:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:24:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:24:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:24:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:24:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:24:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:24:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:24:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:24:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 20:24:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 20:24:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 20:24:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 20:24:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 20:24:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 20:24:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 20:24:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 20:24:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 20:24:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:24:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-08 20:24:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:24:49,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:24:49,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605832669] [2024-11-08 20:24:49,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605832669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:24:49,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:24:49,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 20:24:49,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151424242] [2024-11-08 20:24:49,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:24:49,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 20:24:49,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:24:49,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 20:24:49,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-08 20:24:49,485 INFO L87 Difference]: Start difference. First operand 141 states and 202 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:24:50,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:24:50,310 INFO L93 Difference]: Finished difference Result 408 states and 576 transitions. [2024-11-08 20:24:50,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 20:24:50,312 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-11-08 20:24:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:24:50,315 INFO L225 Difference]: With dead ends: 408 [2024-11-08 20:24:50,316 INFO L226 Difference]: Without dead ends: 278 [2024-11-08 20:24:50,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-08 20:24:50,319 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 99 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 20:24:50,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 804 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 20:24:50,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-08 20:24:50,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 172. [2024-11-08 20:24:50,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 128 states have (on average 1.3046875) internal successors, (167), 130 states have internal predecessors, (167), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 20:24:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 245 transitions. [2024-11-08 20:24:50,343 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 245 transitions. Word has length 210 [2024-11-08 20:24:50,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:24:50,344 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 245 transitions. [2024-11-08 20:24:50,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:24:50,344 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 245 transitions. [2024-11-08 20:24:50,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 20:24:50,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:50,347 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:24:50,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 20:24:50,347 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:50,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:50,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1123688105, now seen corresponding path program 1 times [2024-11-08 20:24:50,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:24:50,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390185402] [2024-11-08 20:24:50,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:50,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:24:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:24:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:24:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:24:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:24:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:24:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:24:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:24:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:24:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:24:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:24:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:24:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:24:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:24:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:24:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:24:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:24:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:24:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:24:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:24:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:24:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:24:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:24:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 20:24:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 20:24:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 20:24:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 20:24:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 20:24:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 20:24:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 20:24:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 20:24:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 20:24:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:24:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-08 20:24:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:24:52,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:24:52,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390185402] [2024-11-08 20:24:52,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390185402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:24:52,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:24:52,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 20:24:52,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346189634] [2024-11-08 20:24:52,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:24:52,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 20:24:52,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:24:52,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 20:24:52,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 20:24:52,918 INFO L87 Difference]: Start difference. First operand 172 states and 245 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:24:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:24:53,349 INFO L93 Difference]: Finished difference Result 379 states and 539 transitions. [2024-11-08 20:24:53,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 20:24:53,350 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-11-08 20:24:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:24:53,351 INFO L225 Difference]: With dead ends: 379 [2024-11-08 20:24:53,352 INFO L226 Difference]: Without dead ends: 218 [2024-11-08 20:24:53,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-08 20:24:53,353 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 105 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:24:53,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 562 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 20:24:53,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-08 20:24:53,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 172. [2024-11-08 20:24:53,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 128 states have (on average 1.3046875) internal successors, (167), 130 states have internal predecessors, (167), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 20:24:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 245 transitions. [2024-11-08 20:24:53,370 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 245 transitions. Word has length 210 [2024-11-08 20:24:53,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:24:53,370 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 245 transitions. [2024-11-08 20:24:53,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:24:53,371 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 245 transitions. [2024-11-08 20:24:53,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 20:24:53,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:53,373 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:24:53,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 20:24:53,374 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:53,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:53,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1000087223, now seen corresponding path program 1 times [2024-11-08 20:24:53,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:24:53,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36891426] [2024-11-08 20:24:53,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:53,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:24:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:24:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:24:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:24:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:24:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:24:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:24:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:24:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:24:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:24:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:24:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:24:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:24:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:24:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:24:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:24:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:24:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:24:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:24:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:24:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:24:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:24:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:24:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 20:24:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 20:24:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 20:24:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 20:24:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 20:24:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 20:24:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 20:24:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 20:24:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 20:24:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:24:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-08 20:24:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:24:53,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:24:53,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36891426] [2024-11-08 20:24:53,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36891426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:24:53,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:24:53,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:24:53,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396486062] [2024-11-08 20:24:53,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:24:53,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:24:53,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:24:53,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:24:53,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:24:53,505 INFO L87 Difference]: Start difference. First operand 172 states and 245 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:24:53,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:24:53,608 INFO L93 Difference]: Finished difference Result 400 states and 566 transitions. [2024-11-08 20:24:53,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:24:53,608 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2024-11-08 20:24:53,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:24:53,611 INFO L225 Difference]: With dead ends: 400 [2024-11-08 20:24:53,611 INFO L226 Difference]: Without dead ends: 239 [2024-11-08 20:24:53,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:24:53,613 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 39 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:24:53,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 239 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:24:53,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-08 20:24:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 208. [2024-11-08 20:24:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 164 states have (on average 1.3109756097560976) internal successors, (215), 166 states have internal predecessors, (215), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 20:24:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 293 transitions. [2024-11-08 20:24:53,634 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 293 transitions. Word has length 211 [2024-11-08 20:24:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:24:53,635 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 293 transitions. [2024-11-08 20:24:53,635 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:24:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 293 transitions. [2024-11-08 20:24:53,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 20:24:53,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:53,638 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:24:53,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 20:24:53,638 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:53,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:53,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1661474987, now seen corresponding path program 1 times [2024-11-08 20:24:53,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:24:53,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277817913] [2024-11-08 20:24:53,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:53,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:24:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:24:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:24:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:24:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:24:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:24:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:24:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:24:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:24:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:24:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:24:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:24:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:24:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:24:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:24:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:24:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:24:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:24:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:24:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:24:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:24:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:24:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:24:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 20:24:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 20:24:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 20:24:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 20:24:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 20:24:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 20:24:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 20:24:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 20:24:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 20:24:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:24:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-08 20:24:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:24:53,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:24:53,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277817913] [2024-11-08 20:24:53,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277817913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:24:53,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:24:53,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:24:53,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839508474] [2024-11-08 20:24:53,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:24:53,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:24:53,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:24:53,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:24:53,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:24:53,929 INFO L87 Difference]: Start difference. First operand 208 states and 293 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:24:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:24:54,135 INFO L93 Difference]: Finished difference Result 581 states and 821 transitions. [2024-11-08 20:24:54,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:24:54,136 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2024-11-08 20:24:54,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:24:54,139 INFO L225 Difference]: With dead ends: 581 [2024-11-08 20:24:54,139 INFO L226 Difference]: Without dead ends: 376 [2024-11-08 20:24:54,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:24:54,140 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 102 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:24:54,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 493 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:24:54,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-08 20:24:54,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 276. [2024-11-08 20:24:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 196 states have (on average 1.2755102040816326) internal successors, (250), 198 states have internal predecessors, (250), 72 states have call successors, (72), 7 states have call predecessors, (72), 7 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-08 20:24:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 394 transitions. [2024-11-08 20:24:54,178 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 394 transitions. Word has length 211 [2024-11-08 20:24:54,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:24:54,179 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 394 transitions. [2024-11-08 20:24:54,179 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:24:54,179 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 394 transitions. [2024-11-08 20:24:54,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 20:24:54,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:54,181 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:24:54,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 20:24:54,182 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:54,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:54,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1028666621, now seen corresponding path program 1 times [2024-11-08 20:24:54,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:24:54,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866358853] [2024-11-08 20:24:54,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:54,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:24:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:24:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:24:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:24:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:24:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:24:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:24:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:24:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:24:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:24:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:24:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:24:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:24:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:24:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:24:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:24:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:24:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:24:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:24:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:24:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:24:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:24:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:24:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 20:24:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 20:24:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 20:24:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 20:24:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 20:24:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 20:24:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 20:24:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 20:24:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 20:24:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:24:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-08 20:24:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:54,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:24:54,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:24:54,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866358853] [2024-11-08 20:24:54,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866358853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:24:54,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:24:54,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:24:54,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804865766] [2024-11-08 20:24:54,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:24:54,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:24:54,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:24:54,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:24:54,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:24:54,295 INFO L87 Difference]: Start difference. First operand 276 states and 394 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:24:54,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:24:54,397 INFO L93 Difference]: Finished difference Result 508 states and 714 transitions. [2024-11-08 20:24:54,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:24:54,398 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2024-11-08 20:24:54,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:24:54,400 INFO L225 Difference]: With dead ends: 508 [2024-11-08 20:24:54,401 INFO L226 Difference]: Without dead ends: 303 [2024-11-08 20:24:54,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:24:54,402 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 46 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:24:54,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 259 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:24:54,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-08 20:24:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 261. [2024-11-08 20:24:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 183 states have (on average 1.2622950819672132) internal successors, (231), 184 states have internal predecessors, (231), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 20:24:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 371 transitions. [2024-11-08 20:24:54,428 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 371 transitions. Word has length 211 [2024-11-08 20:24:54,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:24:54,428 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 371 transitions. [2024-11-08 20:24:54,428 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:24:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 371 transitions. [2024-11-08 20:24:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 20:24:54,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:54,430 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:24:54,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 20:24:54,430 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:54,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:54,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1580133698, now seen corresponding path program 1 times [2024-11-08 20:24:54,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:24:54,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117129567] [2024-11-08 20:24:54,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:54,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:24:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:24:54,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1202692219] [2024-11-08 20:24:54,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:54,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:24:54,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:24:54,520 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:24:54,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 20:24:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:24:54,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:24:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:24:54,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:24:54,933 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:24:54,934 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:24:54,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 20:24:55,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 20:24:55,140 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:24:55,282 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:24:55,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:24:55 BoogieIcfgContainer [2024-11-08 20:24:55,285 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:24:55,286 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:24:55,286 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:24:55,286 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:24:55,287 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:24:37" (3/4) ... [2024-11-08 20:24:55,289 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:24:55,290 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:24:55,290 INFO L158 Benchmark]: Toolchain (without parser) took 18939.89ms. Allocated memory was 153.1MB in the beginning and 436.2MB in the end (delta: 283.1MB). Free memory was 97.0MB in the beginning and 370.7MB in the end (delta: -273.7MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-11-08 20:24:55,291 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 153.1MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:24:55,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.85ms. Allocated memory is still 153.1MB. Free memory was 96.5MB in the beginning and 80.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 20:24:55,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.38ms. Allocated memory is still 153.1MB. Free memory was 80.1MB in the beginning and 76.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:24:55,291 INFO L158 Benchmark]: Boogie Preprocessor took 80.43ms. Allocated memory is still 153.1MB. Free memory was 76.0MB in the beginning and 70.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:24:55,292 INFO L158 Benchmark]: RCFGBuilder took 633.01ms. Allocated memory was 153.1MB in the beginning and 209.7MB in the end (delta: 56.6MB). Free memory was 70.8MB in the beginning and 155.3MB in the end (delta: -84.5MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-11-08 20:24:55,292 INFO L158 Benchmark]: TraceAbstraction took 17809.46ms. Allocated memory was 209.7MB in the beginning and 436.2MB in the end (delta: 226.5MB). Free memory was 154.2MB in the beginning and 371.8MB in the end (delta: -217.5MB). Peak memory consumption was 239.7MB. Max. memory is 16.1GB. [2024-11-08 20:24:55,293 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 436.2MB. Free memory was 371.8MB in the beginning and 370.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 20:24:55,294 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.18ms. Allocated memory is still 153.1MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.85ms. Allocated memory is still 153.1MB. Free memory was 96.5MB in the beginning and 80.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.38ms. Allocated memory is still 153.1MB. Free memory was 80.1MB in the beginning and 76.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.43ms. Allocated memory is still 153.1MB. Free memory was 76.0MB in the beginning and 70.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 633.01ms. Allocated memory was 153.1MB in the beginning and 209.7MB in the end (delta: 56.6MB). Free memory was 70.8MB in the beginning and 155.3MB in the end (delta: -84.5MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17809.46ms. Allocated memory was 209.7MB in the beginning and 436.2MB in the end (delta: 226.5MB). Free memory was 154.2MB in the beginning and 371.8MB in the end (delta: -217.5MB). Peak memory consumption was 239.7MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 436.2MB. Free memory was 371.8MB in the beginning and 370.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryFLOATComparisonOperation at line 149. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] signed long int var_1_22 = 0; [L42] signed long int var_1_23 = 100; [L43] signed long int var_1_24 = 2; [L44] unsigned char var_1_25 = 1; [L45] unsigned char var_1_26 = 1; [L46] unsigned char var_1_27 = 0; [L47] unsigned char var_1_28 = 1; [L48] unsigned char var_1_29 = 1; [L49] float var_1_30 = 2.5; [L50] float var_1_31 = 15.25; [L51] unsigned long int var_1_32 = 256; [L52] unsigned long int var_1_33 = 100; [L53] unsigned short int last_1_var_1_15 = 128; VAL [isInitial=0, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] CALL updateLastVariables() [L155] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L165] RET updateLastVariables() [L166] CALL updateVariables() [L104] var_1_3 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L105] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L106] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L106] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L107] var_1_4 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L108] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L109] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L109] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L110] var_1_5 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L111] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L112] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L112] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L113] var_1_7 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L114] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L115] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L115] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L116] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L116] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L117] var_1_8 = __VERIFIER_nondet_long() [L118] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L118] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L119] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L119] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L120] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L120] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L121] var_1_10 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L122] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L123] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L123] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L124] var_1_11 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L125] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L126] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L126] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L127] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L127] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L128] var_1_16 = __VERIFIER_nondet_long() [L129] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L129] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L130] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L130] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L131] var_1_17 = __VERIFIER_nondet_ushort() [L132] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L132] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L133] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L133] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L134] var_1_21 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L135] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L136] var_1_23 = __VERIFIER_nondet_long() [L137] CALL assume_abort_if_not(var_1_23 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L137] RET assume_abort_if_not(var_1_23 >= -2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L138] CALL assume_abort_if_not(var_1_23 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L138] RET assume_abort_if_not(var_1_23 <= 2147483646) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L139] var_1_25 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L140] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L141] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L141] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L142] var_1_26 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L143] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L144] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L144] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L145] var_1_29 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L146] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L147] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L147] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L148] var_1_31 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L149] RET assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L150] var_1_33 = __VERIFIER_nondet_ulong() [L151] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L151] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L152] CALL assume_abort_if_not(var_1_33 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L152] RET assume_abort_if_not(var_1_33 <= 4294967294) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L166] RET updateVariables() [L167] CALL step() [L57] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L58] COND FALSE !(var_1_25 && var_1_26) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L63] var_1_27 = 0 [L64] var_1_28 = var_1_29 [L65] var_1_30 = var_1_31 [L66] var_1_32 = var_1_33 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L67] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L67] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L72] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L74] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L74] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L75] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L76] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L80] signed long int stepLocal_1 = -4; [L81] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L82] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L87] var_1_18 = var_1_17 [L88] var_1_19 = 0 [L89] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L90] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L93] COND TRUE var_1_3 <= var_1_1 [L94] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L98] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=65534, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L99] COND TRUE (~ var_1_3) < stepLocal_2 [L100] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L167] RET step() [L168] CALL, EXPR property() [L158] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L158] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L158] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L158] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L158] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L158] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L158-L159] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 11, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 664 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 664 mSDsluCounter, 4604 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3176 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1264 IncrementalHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 1428 mSDtfsCounter, 1264 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 759 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=9, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 364 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 2519 NumberOfCodeBlocks, 2519 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2085 ConstructedInterpolants, 0 QuantifiedInterpolants, 6627 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 21120/21120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 20:24:55,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.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 e1856ea979a515682843ea065e3d41725035a700c47302906a364d3e5d5e532f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:24:57,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:24:57,546 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:24:57,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:24:57,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:24:57,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:24:57,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:24:57,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:24:57,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:24:57,596 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:24:57,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:24:57,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:24:57,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:24:57,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:24:57,598 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:24:57,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:24:57,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:24:57,599 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:24:57,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:24:57,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:24:57,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:24:57,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:24:57,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:24:57,605 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:24:57,605 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:24:57,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:24:57,606 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:24:57,606 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:24:57,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:24:57,607 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:24:57,607 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:24:57,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:24:57,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:24:57,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:24:57,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:24:57,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:24:57,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:24:57,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:24:57,612 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:24:57,612 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:24:57,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:24:57,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:24:57,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:24:57,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:24:57,614 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 -> e1856ea979a515682843ea065e3d41725035a700c47302906a364d3e5d5e532f [2024-11-08 20:24:57,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:24:57,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:24:57,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:24:57,942 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:24:57,943 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:24:57,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2024-11-08 20:24:59,373 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:24:59,591 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:24:59,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2024-11-08 20:24:59,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3745b0a4/e1d82e121e354284b403ceb937fa78e2/FLAG8c0cb9d90 [2024-11-08 20:24:59,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3745b0a4/e1d82e121e354284b403ceb937fa78e2 [2024-11-08 20:24:59,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:24:59,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:24:59,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:24:59,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:24:59,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:24:59,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:24:59" (1/1) ... [2024-11-08 20:24:59,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4031cc4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:24:59, skipping insertion in model container [2024-11-08 20:24:59,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:24:59" (1/1) ... [2024-11-08 20:24:59,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:25:00,188 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_fillercodesize_ps-cn-10_file-84.i[915,928] [2024-11-08 20:25:00,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:25:00,292 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:25:00,304 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_fillercodesize_ps-cn-10_file-84.i[915,928] [2024-11-08 20:25:00,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:25:00,375 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:25:00,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:25:00 WrapperNode [2024-11-08 20:25:00,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:25:00,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:25:00,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:25:00,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:25:00,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:25:00" (1/1) ... [2024-11-08 20:25:00,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:25:00" (1/1) ... [2024-11-08 20:25:00,436 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-11-08 20:25:00,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:25:00,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:25:00,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:25:00,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:25:00,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:25:00" (1/1) ... [2024-11-08 20:25:00,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:25:00" (1/1) ... [2024-11-08 20:25:00,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:25:00" (1/1) ... [2024-11-08 20:25:00,470 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:25:00,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:25:00" (1/1) ... [2024-11-08 20:25:00,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:25:00" (1/1) ... [2024-11-08 20:25:00,485 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:25:00" (1/1) ... [2024-11-08 20:25:00,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:25:00" (1/1) ... [2024-11-08 20:25:00,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:25:00" (1/1) ... [2024-11-08 20:25:00,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:25:00" (1/1) ... [2024-11-08 20:25:00,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:25:00,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:25:00,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:25:00,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:25:00,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:25:00" (1/1) ... [2024-11-08 20:25:00,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:25:00,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:25:00,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:25:00,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:25:00,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:25:00,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:25:00,585 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:25:00,585 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:25:00,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:25:00,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:25:00,671 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:25:00,675 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:25:01,260 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 20:25:01,260 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:25:01,280 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:25:01,280 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:25:01,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:25:01 BoogieIcfgContainer [2024-11-08 20:25:01,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:25:01,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:25:01,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:25:01,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:25:01,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:24:59" (1/3) ... [2024-11-08 20:25:01,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27afa7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:25:01, skipping insertion in model container [2024-11-08 20:25:01,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:25:00" (2/3) ... [2024-11-08 20:25:01,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27afa7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:25:01, skipping insertion in model container [2024-11-08 20:25:01,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:25:01" (3/3) ... [2024-11-08 20:25:01,291 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2024-11-08 20:25:01,307 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:25:01,308 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:25:01,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:25:01,373 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;@4a359b03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:25:01,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:25:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:25:01,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 20:25:01,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:25:01,392 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:25:01,393 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:25:01,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:25:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash 645560812, now seen corresponding path program 1 times [2024-11-08 20:25:01,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:25:01,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595262224] [2024-11-08 20:25:01,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:25:01,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:25:01,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:25:01,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:25:01,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 20:25:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:25:01,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:25:01,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:25:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2024-11-08 20:25:01,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:25:01,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:25:01,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595262224] [2024-11-08 20:25:01,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595262224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:25:01,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:25:01,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:25:01,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532161199] [2024-11-08 20:25:01,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:25:01,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:25:01,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:25:01,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:25:01,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:25:01,816 INFO L87 Difference]: Start difference. First operand has 83 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:25:01,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:25:01,843 INFO L93 Difference]: Finished difference Result 159 states and 283 transitions. [2024-11-08 20:25:01,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:25:01,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 202 [2024-11-08 20:25:01,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:25:01,854 INFO L225 Difference]: With dead ends: 159 [2024-11-08 20:25:01,854 INFO L226 Difference]: Without dead ends: 79 [2024-11-08 20:25:01,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:25:01,860 INFO L432 NwaCegarLoop]: 121 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, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:25:01,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:25:01,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-08 20:25:01,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-08 20:25:01,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:25:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2024-11-08 20:25:01,901 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 202 [2024-11-08 20:25:01,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:25:01,901 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2024-11-08 20:25:01,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:25:01,902 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2024-11-08 20:25:01,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 20:25:01,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:25:01,908 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:25:01,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 20:25:02,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:25:02,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:25:02,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:25:02,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1686035182, now seen corresponding path program 1 times [2024-11-08 20:25:02,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:25:02,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8198943] [2024-11-08 20:25:02,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:25:02,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:25:02,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:25:02,114 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:25:02,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 20:25:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:25:02,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 20:25:02,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:25:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:25:02,417 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:25:02,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:25:02,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8198943] [2024-11-08 20:25:02,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8198943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:25:02,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:25:02,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:25:02,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003713461] [2024-11-08 20:25:02,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:25:02,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:25:02,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:25:02,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:25:02,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:25:02,424 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:25:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:25:02,501 INFO L93 Difference]: Finished difference Result 155 states and 239 transitions. [2024-11-08 20:25:02,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:25:02,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 202 [2024-11-08 20:25:02,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:25:02,515 INFO L225 Difference]: With dead ends: 155 [2024-11-08 20:25:02,515 INFO L226 Difference]: Without dead ends: 79 [2024-11-08 20:25:02,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:25:02,517 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 118 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:25:02,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:25:02,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-08 20:25:02,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-08 20:25:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:25:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 120 transitions. [2024-11-08 20:25:02,531 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 120 transitions. Word has length 202 [2024-11-08 20:25:02,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:25:02,533 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 120 transitions. [2024-11-08 20:25:02,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:25:02,533 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2024-11-08 20:25:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 20:25:02,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:25:02,536 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:25:02,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 20:25:02,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:25:02,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:25:02,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:25:02,739 INFO L85 PathProgramCache]: Analyzing trace with hash 876688556, now seen corresponding path program 1 times [2024-11-08 20:25:02,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:25:02,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622201968] [2024-11-08 20:25:02,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:25:02,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:25:02,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:25:02,742 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:25:02,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 20:25:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:25:02,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 20:25:02,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:25:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1058 proven. 39 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2024-11-08 20:25:03,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:25:04,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:25:04,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622201968] [2024-11-08 20:25:04,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622201968] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:25:04,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [900254584] [2024-11-08 20:25:04,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:25:04,287 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 20:25:04,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 20:25:04,291 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 20:25:04,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-08 20:25:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:25:04,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 20:25:04,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:25:05,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1058 proven. 39 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2024-11-08 20:25:05,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:25:05,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [900254584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:25:05,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 20:25:05,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-08 20:25:05,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391714746] [2024-11-08 20:25:05,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 20:25:05,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 20:25:05,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:25:05,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 20:25:05,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-08 20:25:05,600 INFO L87 Difference]: Start difference. First operand 79 states and 120 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:25:07,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:25:07,364 INFO L93 Difference]: Finished difference Result 243 states and 363 transitions. [2024-11-08 20:25:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 20:25:07,365 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 202 [2024-11-08 20:25:07,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:25:07,368 INFO L225 Difference]: With dead ends: 243 [2024-11-08 20:25:07,368 INFO L226 Difference]: Without dead ends: 167 [2024-11-08 20:25:07,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2024-11-08 20:25:07,370 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 144 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 20:25:07,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 582 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 20:25:07,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-08 20:25:07,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 85. [2024-11-08 20:25:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:25:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2024-11-08 20:25:07,406 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 202 [2024-11-08 20:25:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:25:07,408 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2024-11-08 20:25:07,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:25:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2024-11-08 20:25:07,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 20:25:07,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:25:07,414 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:25:07,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 20:25:07,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-08 20:25:07,816 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-08 20:25:07,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:25:07,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:25:07,818 INFO L85 PathProgramCache]: Analyzing trace with hash 874841514, now seen corresponding path program 1 times [2024-11-08 20:25:07,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:25:07,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583592561] [2024-11-08 20:25:07,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:25:07,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:25:07,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:25:07,822 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:25:07,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 20:25:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:25:08,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 20:25:08,008 INFO L278 TraceCheckSpWp]: Computing forward predicates...