./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.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 0feebc1024eac08439331e7773a7511b315939c469dc4e0ad2e111de10ff1692 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:20:44,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:20:44,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 04:20:44,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:20:44,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:20:44,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:20:44,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:20:44,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:20:44,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:20:44,304 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:20:44,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:20:44,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:20:44,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:20:44,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:20:44,307 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:20:44,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:20:44,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:20:44,310 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:20:44,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 04:20:44,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:20:44,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:20:44,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:20:44,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:20:44,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:20:44,312 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:20:44,312 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:20:44,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:20:44,312 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:20:44,313 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:20:44,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:20:44,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:20:44,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:20:44,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:20:44,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:20:44,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:20:44,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:20:44,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 04:20:44,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 04:20:44,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:20:44,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:20:44,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:20:44,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:20:44,318 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 -> 0feebc1024eac08439331e7773a7511b315939c469dc4e0ad2e111de10ff1692 [2024-11-20 04:20:44,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:20:44,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:20:44,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:20:44,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:20:44,663 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:20:44,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i [2024-11-20 04:20:46,230 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:20:46,458 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:20:46,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i [2024-11-20 04:20:46,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f525000a3/ac4cb98c14a04334a7728720473189a1/FLAG3fbf42d56 [2024-11-20 04:20:46,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f525000a3/ac4cb98c14a04334a7728720473189a1 [2024-11-20 04:20:46,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:20:46,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:20:46,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:20:46,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:20:46,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:20:46,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:20:46" (1/1) ... [2024-11-20 04:20:46,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b76e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:46, skipping insertion in model container [2024-11-20 04:20:46,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:20:46" (1/1) ... [2024-11-20 04:20:46,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:20:46,748 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i[918,931] [2024-11-20 04:20:46,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:20:46,857 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:20:46,872 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i[918,931] [2024-11-20 04:20:46,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:20:46,955 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:20:46,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:46 WrapperNode [2024-11-20 04:20:46,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:20:46,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:20:46,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:20:46,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:20:46,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:46" (1/1) ... [2024-11-20 04:20:46,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:46" (1/1) ... [2024-11-20 04:20:47,027 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2024-11-20 04:20:47,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:20:47,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:20:47,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:20:47,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:20:47,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:46" (1/1) ... [2024-11-20 04:20:47,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:46" (1/1) ... [2024-11-20 04:20:47,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:46" (1/1) ... [2024-11-20 04:20:47,076 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 04:20:47,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:46" (1/1) ... [2024-11-20 04:20:47,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:46" (1/1) ... [2024-11-20 04:20:47,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:46" (1/1) ... [2024-11-20 04:20:47,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:46" (1/1) ... [2024-11-20 04:20:47,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:46" (1/1) ... [2024-11-20 04:20:47,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:46" (1/1) ... [2024-11-20 04:20:47,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:20:47,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:20:47,113 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:20:47,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:20:47,115 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:46" (1/1) ... [2024-11-20 04:20:47,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:20:47,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:20:47,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 04:20:47,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 04:20:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:20:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:20:47,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:20:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 04:20:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:20:47,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:20:47,310 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:20:47,313 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:20:47,809 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 04:20:47,810 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:20:47,831 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:20:47,832 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:20:47,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:20:47 BoogieIcfgContainer [2024-11-20 04:20:47,833 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:20:47,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:20:47,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:20:47,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:20:47,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:20:46" (1/3) ... [2024-11-20 04:20:47,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c73c867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:20:47, skipping insertion in model container [2024-11-20 04:20:47,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:46" (2/3) ... [2024-11-20 04:20:47,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c73c867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:20:47, skipping insertion in model container [2024-11-20 04:20:47,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:20:47" (3/3) ... [2024-11-20 04:20:47,844 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i [2024-11-20 04:20:47,863 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:20:47,864 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:20:47,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:20:47,952 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;@29e96c0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:20:47,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:20:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 04:20:47,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-20 04:20:47,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:20:47,980 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:20:47,981 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:20:47,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:20:47,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1886180152, now seen corresponding path program 1 times [2024-11-20 04:20:47,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:20:47,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092392334] [2024-11-20 04:20:47,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:20:47,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:20:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:20:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 04:20:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 04:20:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 04:20:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 04:20:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 04:20:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 04:20:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 04:20:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 04:20:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 04:20:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:20:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:20:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:20:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:20:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:20:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:20:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:20:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:20:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:20:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:20:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:20:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:20:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:20:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:20:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:20:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:20:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:20:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:20:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:20:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:20:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 04:20:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 04:20:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 04:20:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 04:20:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 04:20:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 04:20:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 04:20:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 04:20:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-20 04:20:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-20 04:20:48,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:20:48,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092392334] [2024-11-20 04:20:48,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092392334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:20:48,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:20:48,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:20:48,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078335209] [2024-11-20 04:20:48,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:20:48,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:20:48,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:20:48,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:20:48,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:20:48,822 INFO L87 Difference]: Start difference. First operand has 108 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-20 04:20:48,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:20:48,864 INFO L93 Difference]: Finished difference Result 209 states and 379 transitions. [2024-11-20 04:20:48,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:20:48,867 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) Word has length 243 [2024-11-20 04:20:48,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:20:48,879 INFO L225 Difference]: With dead ends: 209 [2024-11-20 04:20:48,880 INFO L226 Difference]: Without dead ends: 104 [2024-11-20 04:20:48,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:20:48,892 INFO L432 NwaCegarLoop]: 165 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, 165 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:20:48,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:20:48,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-20 04:20:48,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-20 04:20:48,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 04:20:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 165 transitions. [2024-11-20 04:20:48,971 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 165 transitions. Word has length 243 [2024-11-20 04:20:48,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:20:48,972 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 165 transitions. [2024-11-20 04:20:48,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-20 04:20:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 165 transitions. [2024-11-20 04:20:48,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-20 04:20:48,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:20:48,979 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:20:48,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 04:20:48,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:20:48,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:20:48,980 INFO L85 PathProgramCache]: Analyzing trace with hash -763331272, now seen corresponding path program 1 times [2024-11-20 04:20:48,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:20:48,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012155582] [2024-11-20 04:20:48,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:20:48,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:20:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:20:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 04:20:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 04:20:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 04:20:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 04:20:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 04:20:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 04:20:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 04:20:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 04:20:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 04:20:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:20:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:20:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:20:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:20:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:20:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:20:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:20:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:20:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:20:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:20:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:20:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:20:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:20:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:20:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:20:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:20:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:20:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:20:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:20:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:20:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 04:20:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 04:20:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 04:20:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 04:20:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 04:20:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 04:20:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 04:20:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 04:20:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-20 04:20:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-20 04:20:49,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:20:49,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012155582] [2024-11-20 04:20:49,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012155582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:20:49,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:20:49,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:20:49,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847272596] [2024-11-20 04:20:49,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:20:49,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:20:49,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:20:49,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:20:49,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:20:49,553 INFO L87 Difference]: Start difference. First operand 104 states and 165 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:20:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:20:49,679 INFO L93 Difference]: Finished difference Result 205 states and 327 transitions. [2024-11-20 04:20:49,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:20:49,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 243 [2024-11-20 04:20:49,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:20:49,686 INFO L225 Difference]: With dead ends: 205 [2024-11-20 04:20:49,686 INFO L226 Difference]: Without dead ends: 104 [2024-11-20 04:20:49,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:20:49,689 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:20:49,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:20:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-20 04:20:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-20 04:20:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 04:20:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 164 transitions. [2024-11-20 04:20:49,706 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 164 transitions. Word has length 243 [2024-11-20 04:20:49,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:20:49,711 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 164 transitions. [2024-11-20 04:20:49,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:20:49,712 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 164 transitions. [2024-11-20 04:20:49,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-20 04:20:49,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:20:49,718 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:20:49,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 04:20:49,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:20:49,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:20:49,721 INFO L85 PathProgramCache]: Analyzing trace with hash 543098757, now seen corresponding path program 1 times [2024-11-20 04:20:49,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:20:49,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803974248] [2024-11-20 04:20:49,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:20:49,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:20:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:20:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 04:20:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 04:20:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 04:20:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 04:20:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 04:20:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 04:20:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 04:20:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 04:20:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 04:20:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:20:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:20:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:20:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:20:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:20:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:20:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:20:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:20:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:20:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:20:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:20:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:20:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:20:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:20:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:49,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:20:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:20:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:20:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:20:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:20:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:20:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 04:20:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 04:20:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 04:20:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 04:20:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 04:20:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 04:20:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 04:20:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 04:20:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-20 04:20:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-20 04:20:50,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:20:50,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803974248] [2024-11-20 04:20:50,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803974248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:20:50,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:20:50,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:20:50,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309511892] [2024-11-20 04:20:50,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:20:50,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:20:50,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:20:50,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:20:50,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:20:50,068 INFO L87 Difference]: Start difference. First operand 104 states and 164 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:20:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:20:50,174 INFO L93 Difference]: Finished difference Result 304 states and 482 transitions. [2024-11-20 04:20:50,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:20:50,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 244 [2024-11-20 04:20:50,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:20:50,183 INFO L225 Difference]: With dead ends: 304 [2024-11-20 04:20:50,183 INFO L226 Difference]: Without dead ends: 203 [2024-11-20 04:20:50,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:20:50,189 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 147 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:20:50,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 429 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:20:50,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-20 04:20:50,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2024-11-20 04:20:50,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 120 states have (on average 1.3416666666666666) internal successors, (161), 120 states have internal predecessors, (161), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-20 04:20:50,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 317 transitions. [2024-11-20 04:20:50,242 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 317 transitions. Word has length 244 [2024-11-20 04:20:50,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:20:50,247 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 317 transitions. [2024-11-20 04:20:50,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:20:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 317 transitions. [2024-11-20 04:20:50,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-20 04:20:50,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:20:50,251 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:20:50,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 04:20:50,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:20:50,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:20:50,253 INFO L85 PathProgramCache]: Analyzing trace with hash -315303968, now seen corresponding path program 1 times [2024-11-20 04:20:50,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:20:50,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155444597] [2024-11-20 04:20:50,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:20:50,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:20:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:20:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 04:20:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 04:20:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 04:20:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 04:20:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 04:20:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 04:20:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 04:20:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 04:20:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 04:20:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:20:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:20:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:20:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:20:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:20:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:20:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:20:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:20:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:20:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:20:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:20:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:20:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:20:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:20:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:20:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:20:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:20:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:20:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:20:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:20:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 04:20:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 04:20:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 04:20:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 04:20:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 04:20:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 04:20:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 04:20:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 04:20:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-20 04:20:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-20 04:20:50,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:20:50,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155444597] [2024-11-20 04:20:50,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155444597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:20:50,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:20:50,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:20:50,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119712665] [2024-11-20 04:20:50,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:20:50,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:20:50,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:20:50,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:20:50,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:20:50,616 INFO L87 Difference]: Start difference. First operand 201 states and 317 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:20:50,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:20:50,758 INFO L93 Difference]: Finished difference Result 587 states and 929 transitions. [2024-11-20 04:20:50,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:20:50,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 245 [2024-11-20 04:20:50,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:20:50,768 INFO L225 Difference]: With dead ends: 587 [2024-11-20 04:20:50,770 INFO L226 Difference]: Without dead ends: 389 [2024-11-20 04:20:50,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:20:50,777 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 149 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:20:50,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 274 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:20:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-20 04:20:50,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 229. [2024-11-20 04:20:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 148 states have (on average 1.3716216216216217) internal successors, (203), 148 states have internal predecessors, (203), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-20 04:20:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 359 transitions. [2024-11-20 04:20:50,858 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 359 transitions. Word has length 245 [2024-11-20 04:20:50,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:20:50,859 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 359 transitions. [2024-11-20 04:20:50,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:20:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 359 transitions. [2024-11-20 04:20:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-20 04:20:50,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:20:50,862 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:20:50,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 04:20:50,863 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:20:50,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:20:50,863 INFO L85 PathProgramCache]: Analyzing trace with hash 107397858, now seen corresponding path program 1 times [2024-11-20 04:20:50,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:20:50,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451200538] [2024-11-20 04:20:50,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:20:50,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:20:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:20:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 04:20:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 04:20:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 04:20:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 04:20:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 04:20:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 04:20:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 04:20:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 04:20:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 04:20:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:20:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:20:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:20:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:20:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:20:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:20:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:20:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:20:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:20:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:20:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:20:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:20:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:20:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:20:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:20:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:20:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:20:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:20:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:20:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:20:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 04:20:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 04:20:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 04:20:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 04:20:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 04:20:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 04:20:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 04:20:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 04:20:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-20 04:20:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-20 04:20:51,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:20:51,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451200538] [2024-11-20 04:20:51,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451200538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:20:51,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:20:51,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:20:51,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32288037] [2024-11-20 04:20:51,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:20:51,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:20:51,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:20:51,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:20:51,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:20:51,134 INFO L87 Difference]: Start difference. First operand 229 states and 359 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:20:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:20:51,213 INFO L93 Difference]: Finished difference Result 455 states and 715 transitions. [2024-11-20 04:20:51,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:20:51,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 245 [2024-11-20 04:20:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:20:51,217 INFO L225 Difference]: With dead ends: 455 [2024-11-20 04:20:51,217 INFO L226 Difference]: Without dead ends: 229 [2024-11-20 04:20:51,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:20:51,220 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:20:51,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:20:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-20 04:20:51,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-11-20 04:20:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 148 states have (on average 1.3581081081081081) internal successors, (201), 148 states have internal predecessors, (201), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-20 04:20:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 357 transitions. [2024-11-20 04:20:51,282 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 357 transitions. Word has length 245 [2024-11-20 04:20:51,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:20:51,285 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 357 transitions. [2024-11-20 04:20:51,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:20:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 357 transitions. [2024-11-20 04:20:51,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-20 04:20:51,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:20:51,290 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:20:51,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 04:20:51,291 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:20:51,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:20:51,291 INFO L85 PathProgramCache]: Analyzing trace with hash -903719392, now seen corresponding path program 1 times [2024-11-20 04:20:51,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:20:51,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30959186] [2024-11-20 04:20:51,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:20:51,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:20:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:20:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 04:20:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 04:20:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 04:20:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 04:20:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 04:20:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 04:20:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 04:20:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 04:20:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 04:20:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:20:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:20:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:20:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:20:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:20:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:20:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:20:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:20:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:20:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:20:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:20:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:20:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:20:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:20:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:20:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:20:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:20:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:20:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:20:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:20:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 04:20:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 04:20:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 04:20:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 04:20:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 04:20:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 04:20:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 04:20:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 04:20:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-20 04:20:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-20 04:20:51,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:20:51,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30959186] [2024-11-20 04:20:51,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30959186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:20:51,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:20:51,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:20:51,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882185445] [2024-11-20 04:20:51,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:20:51,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:20:51,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:20:51,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:20:51,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:20:51,581 INFO L87 Difference]: Start difference. First operand 229 states and 357 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:20:51,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:20:51,685 INFO L93 Difference]: Finished difference Result 615 states and 961 transitions. [2024-11-20 04:20:51,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:20:51,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 245 [2024-11-20 04:20:51,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:20:51,689 INFO L225 Difference]: With dead ends: 615 [2024-11-20 04:20:51,690 INFO L226 Difference]: Without dead ends: 389 [2024-11-20 04:20:51,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:20:51,692 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 123 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:20:51,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 386 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:20:51,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-20 04:20:51,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 243. [2024-11-20 04:20:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 162 states have (on average 1.3518518518518519) internal successors, (219), 162 states have internal predecessors, (219), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-20 04:20:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 375 transitions. [2024-11-20 04:20:51,750 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 375 transitions. Word has length 245 [2024-11-20 04:20:51,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:20:51,751 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 375 transitions. [2024-11-20 04:20:51,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:20:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 375 transitions. [2024-11-20 04:20:51,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-20 04:20:51,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:20:51,757 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:20:51,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 04:20:51,757 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:20:51,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:20:51,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1027007738, now seen corresponding path program 1 times [2024-11-20 04:20:51,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:20:51,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407606364] [2024-11-20 04:20:51,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:20:51,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:20:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:20:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 04:20:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 04:20:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 04:20:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 04:20:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 04:20:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 04:20:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 04:20:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 04:20:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 04:20:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:20:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 04:20:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:20:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 04:20:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:20:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 04:20:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:20:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:20:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:20:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:20:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:20:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:20:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 04:20:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:20:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 04:20:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:20:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 04:20:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 04:20:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 04:20:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 04:20:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 04:20:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 04:20:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 04:20:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 04:20:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 04:20:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 04:20:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 04:20:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 04:20:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-20 04:20:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:20:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-20 04:20:52,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:20:52,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407606364] [2024-11-20 04:20:52,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407606364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:20:52,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:20:52,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:20:52,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677930672] [2024-11-20 04:20:52,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:20:52,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:20:52,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:20:52,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:20:52,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:20:52,410 INFO L87 Difference]: Start difference. First operand 243 states and 375 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:20:52,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:20:52,941 INFO L93 Difference]: Finished difference Result 790 states and 1220 transitions. [2024-11-20 04:20:52,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:20:52,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 245 [2024-11-20 04:20:52,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:20:52,947 INFO L225 Difference]: With dead ends: 790 [2024-11-20 04:20:52,947 INFO L226 Difference]: Without dead ends: 550 [2024-11-20 04:20:52,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:20:52,949 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 278 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 04:20:52,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 414 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 04:20:52,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-20 04:20:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 400. [2024-11-20 04:20:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 259 states have (on average 1.332046332046332) internal successors, (345), 261 states have internal predecessors, (345), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 134 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-20 04:20:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 617 transitions. [2024-11-20 04:20:53,025 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 617 transitions. Word has length 245 [2024-11-20 04:20:53,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:20:53,025 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 617 transitions. [2024-11-20 04:20:53,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:20:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 617 transitions. [2024-11-20 04:20:53,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-20 04:20:53,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:20:53,029 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:20:53,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 04:20:53,029 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:20:53,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:20:53,030 INFO L85 PathProgramCache]: Analyzing trace with hash 747999624, now seen corresponding path program 1 times [2024-11-20 04:20:53,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:20:53,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6309525] [2024-11-20 04:20:53,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:20:53,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:20:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 04:20:53,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [177846838] [2024-11-20 04:20:53,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:20:53,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:20:53,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:20:53,224 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:20:53,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 04:20:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:20:53,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 04:20:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:20:53,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 04:20:53,633 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 04:20:53,634 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 04:20:53,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 04:20:53,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:20:53,841 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:20:54,023 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 04:20:54,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:20:54 BoogieIcfgContainer [2024-11-20 04:20:54,027 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 04:20:54,028 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 04:20:54,028 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 04:20:54,028 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 04:20:54,029 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:20:47" (3/4) ... [2024-11-20 04:20:54,031 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 04:20:54,033 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 04:20:54,033 INFO L158 Benchmark]: Toolchain (without parser) took 7532.47ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 107.5MB in the beginning and 83.2MB in the end (delta: 24.3MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. [2024-11-20 04:20:54,034 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 100.7MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:20:54,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.82ms. Allocated memory is still 140.5MB. Free memory was 106.6MB in the beginning and 89.0MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 04:20:54,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.77ms. Allocated memory is still 140.5MB. Free memory was 89.0MB in the beginning and 84.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 04:20:54,034 INFO L158 Benchmark]: Boogie Preprocessor took 80.57ms. Allocated memory is still 140.5MB. Free memory was 84.8MB in the beginning and 80.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 04:20:54,035 INFO L158 Benchmark]: RCFGBuilder took 723.36ms. Allocated memory is still 140.5MB. Free memory was 80.3MB in the beginning and 87.0MB in the end (delta: -6.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 04:20:54,035 INFO L158 Benchmark]: TraceAbstraction took 6191.83ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 87.0MB in the beginning and 83.2MB in the end (delta: 3.7MB). Peak memory consumption was 70.7MB. Max. memory is 16.1GB. [2024-11-20 04:20:54,035 INFO L158 Benchmark]: Witness Printer took 5.24ms. Allocated memory is still 205.5MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:20:54,038 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.39ms. Allocated memory is still 100.7MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.82ms. Allocated memory is still 140.5MB. Free memory was 106.6MB in the beginning and 89.0MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.77ms. Allocated memory is still 140.5MB. Free memory was 89.0MB in the beginning and 84.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.57ms. Allocated memory is still 140.5MB. Free memory was 84.8MB in the beginning and 80.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 723.36ms. Allocated memory is still 140.5MB. Free memory was 80.3MB in the beginning and 87.0MB in the end (delta: -6.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6191.83ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 87.0MB in the beginning and 83.2MB in the end (delta: 3.7MB). Peak memory consumption was 70.7MB. Max. memory is 16.1GB. * Witness Printer took 5.24ms. Allocated memory is still 205.5MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 204, overapproximation of someBinaryFLOATComparisonOperation at line 204. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] double var_1_6 = 31.5; [L24] double var_1_9 = 1000000000.25; [L25] float var_1_10 = 1.1; [L26] float var_1_11 = 8.75; [L27] float var_1_12 = 63.8; [L28] unsigned char var_1_13 = 1; [L29] float var_1_14 = 127.5; [L30] signed char var_1_15 = -2; [L31] signed char var_1_16 = 1; [L32] signed char var_1_17 = 1; [L33] signed char var_1_18 = 1; [L34] signed char var_1_19 = -2; [L35] signed char var_1_20 = 16; [L36] signed char var_1_21 = 2; [L37] signed char var_1_22 = 8; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_26 = 0; [L42] unsigned char var_1_27 = 32; [L43] unsigned char var_1_28 = 1; [L44] unsigned long int var_1_33 = 10; [L45] unsigned long int var_1_35 = 2632045268; [L46] signed long int var_1_36 = 32; [L47] unsigned long int var_1_37 = 128; [L48] unsigned long int var_1_39 = 1877460848; [L49] unsigned long int var_1_40 = 1831388024; [L50] unsigned long int var_1_41 = 1967003719; [L51] unsigned char var_1_42 = 0; [L52] unsigned char var_1_43 = 0; [L53] unsigned char var_1_45 = 0; [L54] unsigned char var_1_46 = 0; [L55] unsigned char var_1_47 = 1; [L56] unsigned char var_1_48 = 1; [L57] unsigned short int var_1_49 = 0; VAL [isInitial=0, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2, var_1_9=4000000001/4] [L208] isInitial = 1 [L209] FCALL initially() [L210] COND TRUE 1 [L211] FCALL updateLastVariables() [L212] CALL updateVariables() [L140] var_1_9 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L141] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L142] var_1_11 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L143] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L144] var_1_13 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L145] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L146] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L146] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L147] var_1_14 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L148] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L149] var_1_16 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L150] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L151] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L151] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L152] var_1_17 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L153] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L154] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L154] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L155] var_1_19 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L156] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L157] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L157] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L158] var_1_20 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L159] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L160] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L160] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L161] var_1_21 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L162] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L163] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L163] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L164] var_1_22 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_22 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L165] RET assume_abort_if_not(var_1_22 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L166] CALL assume_abort_if_not(var_1_22 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L166] RET assume_abort_if_not(var_1_22 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L167] var_1_24 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L168] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L169] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L169] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L170] var_1_25 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L171] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L172] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L172] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L173] var_1_26 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L174] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L175] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L175] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L176] var_1_35 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_35 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L177] RET assume_abort_if_not(var_1_35 >= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L178] CALL assume_abort_if_not(var_1_35 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L178] RET assume_abort_if_not(var_1_35 <= 4294967294) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L179] var_1_39 = __VERIFIER_nondet_ulong() [L180] CALL assume_abort_if_not(var_1_39 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L180] RET assume_abort_if_not(var_1_39 >= 1073741823) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L181] CALL assume_abort_if_not(var_1_39 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L181] RET assume_abort_if_not(var_1_39 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L182] var_1_40 = __VERIFIER_nondet_ulong() [L183] CALL assume_abort_if_not(var_1_40 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L183] RET assume_abort_if_not(var_1_40 >= 1073741824) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L184] CALL assume_abort_if_not(var_1_40 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L184] RET assume_abort_if_not(var_1_40 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L185] var_1_41 = __VERIFIER_nondet_ulong() [L186] CALL assume_abort_if_not(var_1_41 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L186] RET assume_abort_if_not(var_1_41 >= 1073741824) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L187] CALL assume_abort_if_not(var_1_41 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L187] RET assume_abort_if_not(var_1_41 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L188] var_1_43 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L189] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L190] CALL assume_abort_if_not(var_1_43 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L190] RET assume_abort_if_not(var_1_43 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L191] var_1_45 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L192] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L193] CALL assume_abort_if_not(var_1_45 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L193] RET assume_abort_if_not(var_1_45 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L194] var_1_47 = __VERIFIER_nondet_uchar() [L195] CALL assume_abort_if_not(var_1_47 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L195] RET assume_abort_if_not(var_1_47 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L196] CALL assume_abort_if_not(var_1_47 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L196] RET assume_abort_if_not(var_1_47 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L197] var_1_48 = __VERIFIER_nondet_uchar() [L198] CALL assume_abort_if_not(var_1_48 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L198] RET assume_abort_if_not(var_1_48 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L199] CALL assume_abort_if_not(var_1_48 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L199] RET assume_abort_if_not(var_1_48 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L212] RET updateVariables() [L213] CALL step() [L61] var_1_15 = (var_1_16 - var_1_17) [L62] var_1_27 = var_1_21 [L63] unsigned char stepLocal_1 = var_1_27; [L64] unsigned char stepLocal_0 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L65] COND TRUE (var_1_27 + var_1_27) <= stepLocal_1 [L66] var_1_1 = (128 + var_1_27) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L74] COND FALSE !(var_1_27 < (var_1_27 - var_1_27)) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L77] unsigned char stepLocal_2 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L78] COND FALSE !(var_1_27 > stepLocal_2) [L81] var_1_10 = 9.75f VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L83] COND TRUE ((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u [L84] var_1_18 = (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L86] signed long int stepLocal_5 = ~ var_1_21; VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L87] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L96] unsigned char stepLocal_4 = var_1_18 >= var_1_27; [L97] unsigned char stepLocal_3 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=1, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L98] COND FALSE !(var_1_23 && stepLocal_4) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L101] COND TRUE 1 >= stepLocal_3 [L102] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L107] EXPR var_1_27 | (var_1_27 + var_1_27) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L107] COND FALSE !(var_1_27 < (var_1_27 | (var_1_27 + var_1_27))) [L110] EXPR var_1_27 >> var_1_27 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L110] COND TRUE var_1_27 >= (var_1_27 >> var_1_27) [L111] COND FALSE !(var_1_23 || (var_1_27 < var_1_27)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L115] COND FALSE !(var_1_27 > (var_1_27 / var_1_35)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L118] COND TRUE 63.75f <= var_1_10 [L119] var_1_37 = ((var_1_39 + ((((var_1_40) > (var_1_41)) ? (var_1_40) : (var_1_41)))) - ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-2147483649, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L121] COND FALSE !(var_1_41 < ((((var_1_27) < (var_1_1)) ? (var_1_27) : (var_1_1)))) [L124] var_1_42 = (var_1_45 || var_1_43) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-2147483649, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L126] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-2147483649, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L133] COND FALSE !((var_1_39 - ((((-50) < 0 ) ? -(-50) : (-50)))) < var_1_18) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-2147483649, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L213] RET step() [L214] CALL, EXPR property() [L204-L205] return (((((((((var_1_27 + var_1_27) <= var_1_27) ? (var_1_1 == ((signed short int) (128 + var_1_27))) : ((var_1_27 >= (var_1_27 * var_1_27)) ? (var_1_1 == ((signed short int) var_1_27)) : (var_1_1 == ((signed short int) 1)))) && ((var_1_27 < (var_1_27 - var_1_27)) ? (var_1_6 == ((double) var_1_9)) : 1)) && ((var_1_27 > var_1_27) ? (var_1_10 == ((float) (1.00000000000009E13f - var_1_11))) : (var_1_10 == ((float) 9.75f)))) && ((var_1_23 && (var_1_18 >= var_1_27)) ? (var_1_12 == ((float) var_1_11)) : ((1 >= var_1_27) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_14))))) && (var_1_15 == ((signed char) (var_1_16 - var_1_17)))) && ((((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u) ? (var_1_18 == ((signed char) (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))))) : 1)) && (var_1_13 ? (((~ var_1_21) > var_1_27) ? (var_1_23 == ((unsigned char) (var_1_24 && (! var_1_25)))) : (var_1_24 ? (var_1_23 == ((unsigned char) ((! var_1_25) || var_1_26))) : 1)) : 1)) && (var_1_27 == ((unsigned char) var_1_21)) ; VAL [\result=0, isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-2147483649, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L214] RET, EXPR property() [L214] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-2147483649, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L19] reach_error() VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-2147483649, var_1_39=-3221225473, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 8, TraceHistogramMax: 39, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 697 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 697 mSDsluCounter, 2251 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 837 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 343 IncrementalHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 1414 mSDtfsCounter, 343 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 608 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=400occurred in iteration=7, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 458 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2200 NumberOfCodeBlocks, 2200 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1703 ConstructedInterpolants, 0 QuantifiedInterpolants, 1958 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 20748/20748 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 04:20:54,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.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 0feebc1024eac08439331e7773a7511b315939c469dc4e0ad2e111de10ff1692 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:20:56,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:20:56,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 04:20:56,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:20:56,747 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:20:56,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:20:56,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:20:56,781 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:20:56,782 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:20:56,782 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:20:56,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:20:56,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:20:56,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:20:56,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:20:56,787 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:20:56,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:20:56,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:20:56,788 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:20:56,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:20:56,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:20:56,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:20:56,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:20:56,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:20:56,793 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 04:20:56,793 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 04:20:56,794 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:20:56,794 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 04:20:56,794 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:20:56,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:20:56,795 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:20:56,795 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:20:56,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:20:56,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:20:56,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:20:56,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:20:56,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:20:56,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:20:56,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:20:56,797 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 04:20:56,797 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 04:20:56,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:20:56,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:20:56,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:20:56,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:20:56,799 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 -> 0feebc1024eac08439331e7773a7511b315939c469dc4e0ad2e111de10ff1692 [2024-11-20 04:20:57,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:20:57,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:20:57,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:20:57,229 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:20:57,229 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:20:57,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i [2024-11-20 04:20:58,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:20:59,255 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:20:59,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i [2024-11-20 04:20:59,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f56f1ba70/ccd517b6f5ea400292c3436dda096635/FLAGaf8d9afa4 [2024-11-20 04:20:59,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f56f1ba70/ccd517b6f5ea400292c3436dda096635 [2024-11-20 04:20:59,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:20:59,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:20:59,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:20:59,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:20:59,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:20:59,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:20:59" (1/1) ... [2024-11-20 04:20:59,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13e71bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:59, skipping insertion in model container [2024-11-20 04:20:59,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:20:59" (1/1) ... [2024-11-20 04:20:59,347 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:20:59,579 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i[918,931] [2024-11-20 04:20:59,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:20:59,717 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:20:59,733 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i[918,931] [2024-11-20 04:20:59,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:20:59,805 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:20:59,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:59 WrapperNode [2024-11-20 04:20:59,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:20:59,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:20:59,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:20:59,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:20:59,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:59" (1/1) ... [2024-11-20 04:20:59,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:59" (1/1) ... [2024-11-20 04:20:59,881 INFO L138 Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2024-11-20 04:20:59,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:20:59,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:20:59,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:20:59,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:20:59,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:59" (1/1) ... [2024-11-20 04:20:59,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:59" (1/1) ... [2024-11-20 04:20:59,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:59" (1/1) ... [2024-11-20 04:20:59,943 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 04:20:59,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:59" (1/1) ... [2024-11-20 04:20:59,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:59" (1/1) ... [2024-11-20 04:20:59,954 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:59" (1/1) ... [2024-11-20 04:20:59,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:59" (1/1) ... [2024-11-20 04:20:59,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:59" (1/1) ... [2024-11-20 04:20:59,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:59" (1/1) ... [2024-11-20 04:20:59,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:20:59,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:20:59,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:20:59,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:20:59,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:59" (1/1) ... [2024-11-20 04:20:59,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:21:00,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:21:00,043 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 04:21:00,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 04:21:00,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:21:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 04:21:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:21:00,095 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:21:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:21:00,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:21:00,197 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:21:00,200 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:21:00,933 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 04:21:00,933 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:21:00,955 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:21:00,956 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:21:00,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:21:00 BoogieIcfgContainer [2024-11-20 04:21:00,956 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:21:00,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:21:00,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:21:00,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:21:00,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:20:59" (1/3) ... [2024-11-20 04:21:00,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704b13a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:21:00, skipping insertion in model container [2024-11-20 04:21:00,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:20:59" (2/3) ... [2024-11-20 04:21:00,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704b13a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:21:00, skipping insertion in model container [2024-11-20 04:21:00,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:21:00" (3/3) ... [2024-11-20 04:21:00,970 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i [2024-11-20 04:21:00,991 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:21:00,991 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:21:01,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:21:01,091 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;@647a40f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:21:01,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:21:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 04:21:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-20 04:21:01,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:21:01,119 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:21:01,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:21:01,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:21:01,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1193879483, now seen corresponding path program 1 times [2024-11-20 04:21:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:21:01,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90645439] [2024-11-20 04:21:01,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:21:01,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:21:01,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:21:01,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:21:01,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 04:21:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:21:01,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 04:21:01,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:21:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 620 proven. 0 refuted. 0 times theorem prover too weak. 2344 trivial. 0 not checked. [2024-11-20 04:21:01,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:21:01,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:21:01,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90645439] [2024-11-20 04:21:01,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90645439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:21:01,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:21:01,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:21:01,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898023415] [2024-11-20 04:21:01,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:21:01,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:21:01,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:21:01,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:21:01,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:21:01,697 INFO L87 Difference]: Start difference. First operand has 103 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-20 04:21:01,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:21:01,750 INFO L93 Difference]: Finished difference Result 199 states and 363 transitions. [2024-11-20 04:21:01,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:21:01,754 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 241 [2024-11-20 04:21:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:21:01,773 INFO L225 Difference]: With dead ends: 199 [2024-11-20 04:21:01,773 INFO L226 Difference]: Without dead ends: 99 [2024-11-20 04:21:01,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:21:01,784 INFO L432 NwaCegarLoop]: 156 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, 156 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:21:01,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:21:01,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-20 04:21:01,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-20 04:21:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 04:21:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 156 transitions. [2024-11-20 04:21:01,860 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 156 transitions. Word has length 241 [2024-11-20 04:21:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:21:01,861 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 156 transitions. [2024-11-20 04:21:01,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-20 04:21:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 156 transitions. [2024-11-20 04:21:01,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-20 04:21:01,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:21:01,871 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:21:01,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 04:21:02,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:21:02,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:21:02,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:21:02,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1667030011, now seen corresponding path program 1 times [2024-11-20 04:21:02,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:21:02,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860229040] [2024-11-20 04:21:02,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:21:02,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:21:02,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:21:02,081 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:21:02,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 04:21:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:21:02,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 04:21:02,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:21:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1391 proven. 144 refuted. 0 times theorem prover too weak. 1429 trivial. 0 not checked. [2024-11-20 04:21:03,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:21:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-20 04:21:03,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:21:03,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860229040] [2024-11-20 04:21:03,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860229040] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 04:21:03,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 04:21:03,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-11-20 04:21:03,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513780535] [2024-11-20 04:21:03,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:21:03,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:21:03,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:21:03,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:21:03,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-20 04:21:03,740 INFO L87 Difference]: Start difference. First operand 99 states and 156 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:21:04,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:21:04,050 INFO L93 Difference]: Finished difference Result 206 states and 329 transitions. [2024-11-20 04:21:04,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:21:04,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 242 [2024-11-20 04:21:04,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:21:04,054 INFO L225 Difference]: With dead ends: 206 [2024-11-20 04:21:04,055 INFO L226 Difference]: Without dead ends: 110 [2024-11-20 04:21:04,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-20 04:21:04,057 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 19 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 04:21:04,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 289 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 04:21:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-20 04:21:04,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 99. [2024-11-20 04:21:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 58 states have internal predecessors, (77), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 04:21:04,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 155 transitions. [2024-11-20 04:21:04,072 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 155 transitions. Word has length 242 [2024-11-20 04:21:04,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:21:04,074 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 155 transitions. [2024-11-20 04:21:04,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:21:04,074 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 155 transitions. [2024-11-20 04:21:04,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-20 04:21:04,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:21:04,078 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:21:04,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 04:21:04,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:21:04,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:21:04,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:21:04,280 INFO L85 PathProgramCache]: Analyzing trace with hash 633792579, now seen corresponding path program 1 times [2024-11-20 04:21:04,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:21:04,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840243240] [2024-11-20 04:21:04,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:21:04,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:21:04,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:21:04,286 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:21:04,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 04:21:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:21:04,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 04:21:04,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:21:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-20 04:21:05,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:21:05,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:21:05,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840243240] [2024-11-20 04:21:05,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840243240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:21:05,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:21:05,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:21:05,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047762424] [2024-11-20 04:21:05,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:21:05,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:21:05,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:21:05,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:21:05,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:21:05,076 INFO L87 Difference]: Start difference. First operand 99 states and 155 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:21:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:21:05,178 INFO L93 Difference]: Finished difference Result 289 states and 455 transitions. [2024-11-20 04:21:05,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:21:05,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 242 [2024-11-20 04:21:05,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:21:05,188 INFO L225 Difference]: With dead ends: 289 [2024-11-20 04:21:05,189 INFO L226 Difference]: Without dead ends: 193 [2024-11-20 04:21:05,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:21:05,194 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 28 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:21:05,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 288 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:21:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-20 04:21:05,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2024-11-20 04:21:05,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 110 states have (on average 1.290909090909091) internal successors, (142), 110 states have internal predecessors, (142), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-20 04:21:05,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 298 transitions. [2024-11-20 04:21:05,232 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 298 transitions. Word has length 242 [2024-11-20 04:21:05,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:21:05,233 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 298 transitions. [2024-11-20 04:21:05,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:21:05,234 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 298 transitions. [2024-11-20 04:21:05,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-20 04:21:05,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:21:05,238 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:21:05,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-20 04:21:05,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:21:05,439 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:21:05,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:21:05,439 INFO L85 PathProgramCache]: Analyzing trace with hash 91220424, now seen corresponding path program 1 times [2024-11-20 04:21:05,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:21:05,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155688534] [2024-11-20 04:21:05,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:21:05,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:21:05,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:21:05,445 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:21:05,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 04:21:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:21:05,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 04:21:05,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:21:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1391 proven. 144 refuted. 0 times theorem prover too weak. 1429 trivial. 0 not checked. [2024-11-20 04:21:06,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:21:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-20 04:21:07,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:21:07,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155688534] [2024-11-20 04:21:07,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155688534] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 04:21:07,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 04:21:07,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2024-11-20 04:21:07,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821638311] [2024-11-20 04:21:07,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:21:07,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 04:21:07,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:21:07,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 04:21:07,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-20 04:21:07,076 INFO L87 Difference]: Start difference. First operand 191 states and 298 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:21:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:21:08,496 INFO L93 Difference]: Finished difference Result 744 states and 1167 transitions. [2024-11-20 04:21:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 04:21:08,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 243 [2024-11-20 04:21:08,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:21:08,504 INFO L225 Difference]: With dead ends: 744 [2024-11-20 04:21:08,504 INFO L226 Difference]: Without dead ends: 556 [2024-11-20 04:21:08,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 471 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-20 04:21:08,507 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 357 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 04:21:08,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 544 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 04:21:08,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-20 04:21:08,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 226. [2024-11-20 04:21:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 145 states have internal predecessors, (192), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-20 04:21:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 348 transitions. [2024-11-20 04:21:08,560 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 348 transitions. Word has length 243 [2024-11-20 04:21:08,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:21:08,561 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 348 transitions. [2024-11-20 04:21:08,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:21:08,562 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 348 transitions. [2024-11-20 04:21:08,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-20 04:21:08,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:21:08,566 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:21:08,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-20 04:21:08,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:21:08,767 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:21:08,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:21:08,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1029444232, now seen corresponding path program 1 times [2024-11-20 04:21:08,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:21:08,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208300829] [2024-11-20 04:21:08,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:21:08,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:21:08,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:21:08,773 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:21:08,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 04:21:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:21:09,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 04:21:09,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:21:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-20 04:21:09,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:21:09,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:21:09,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208300829] [2024-11-20 04:21:09,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208300829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:21:09,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:21:09,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:21:09,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706420062] [2024-11-20 04:21:09,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:21:09,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:21:09,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:21:09,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:21:09,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:21:09,120 INFO L87 Difference]: Start difference. First operand 226 states and 348 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:21:09,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:21:09,246 INFO L93 Difference]: Finished difference Result 523 states and 807 transitions. [2024-11-20 04:21:09,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:21:09,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 243 [2024-11-20 04:21:09,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:21:09,255 INFO L225 Difference]: With dead ends: 523 [2024-11-20 04:21:09,255 INFO L226 Difference]: Without dead ends: 300 [2024-11-20 04:21:09,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:21:09,258 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 140 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:21:09,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 368 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:21:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-20 04:21:09,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 226. [2024-11-20 04:21:09,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 145 states have (on average 1.303448275862069) internal successors, (189), 145 states have internal predecessors, (189), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-20 04:21:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 345 transitions. [2024-11-20 04:21:09,304 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 345 transitions. Word has length 243 [2024-11-20 04:21:09,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:21:09,306 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 345 transitions. [2024-11-20 04:21:09,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-20 04:21:09,306 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 345 transitions. [2024-11-20 04:21:09,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-20 04:21:09,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:21:09,313 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:21:09,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-20 04:21:09,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:21:09,514 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:21:09,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:21:09,514 INFO L85 PathProgramCache]: Analyzing trace with hash 220097606, now seen corresponding path program 1 times [2024-11-20 04:21:09,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:21:09,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785812372] [2024-11-20 04:21:09,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:21:09,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:21:09,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:21:09,517 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:21:09,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 04:21:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:21:09,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 04:21:09,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:21:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1975 proven. 117 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2024-11-20 04:21:10,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:21:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2024-11-20 04:21:11,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:21:11,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785812372] [2024-11-20 04:21:11,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785812372] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:21:11,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 04:21:11,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2024-11-20 04:21:11,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974711942] [2024-11-20 04:21:11,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 04:21:11,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 04:21:11,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:21:11,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 04:21:11,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-11-20 04:21:11,174 INFO L87 Difference]: Start difference. First operand 226 states and 345 transitions. Second operand has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 5 states have call successors, (64), 4 states have call predecessors, (64), 7 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2024-11-20 04:21:13,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:21:13,462 INFO L93 Difference]: Finished difference Result 660 states and 970 transitions. [2024-11-20 04:21:13,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-20 04:21:13,463 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 5 states have call successors, (64), 4 states have call predecessors, (64), 7 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) Word has length 243 [2024-11-20 04:21:13,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:21:13,467 INFO L225 Difference]: With dead ends: 660 [2024-11-20 04:21:13,467 INFO L226 Difference]: Without dead ends: 437 [2024-11-20 04:21:13,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=360, Invalid=830, Unknown=0, NotChecked=0, Total=1190 [2024-11-20 04:21:13,470 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 708 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 04:21:13,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 450 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 04:21:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-20 04:21:13,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 258. [2024-11-20 04:21:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 169 states have (on average 1.242603550295858) internal successors, (210), 169 states have internal predecessors, (210), 78 states have call successors, (78), 10 states have call predecessors, (78), 10 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-20 04:21:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 366 transitions. [2024-11-20 04:21:13,529 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 366 transitions. Word has length 243 [2024-11-20 04:21:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:21:13,529 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 366 transitions. [2024-11-20 04:21:13,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 5 states have call successors, (64), 4 states have call predecessors, (64), 7 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2024-11-20 04:21:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 366 transitions. [2024-11-20 04:21:13,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-20 04:21:13,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:21:13,533 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:21:13,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 04:21:13,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:21:13,734 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:21:13,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:21:13,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1995104968, now seen corresponding path program 1 times [2024-11-20 04:21:13,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:21:13,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768414139] [2024-11-20 04:21:13,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:21:13,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:21:13,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:21:13,740 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:21:13,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 (8)] Waiting until timeout for monitored process [2024-11-20 04:21:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:21:14,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 04:21:14,088 INFO L278 TraceCheckSpWp]: Computing forward predicates...