./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-pr-cn_file-9.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-pr-cn_file-9.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 e75dd2ef07e59a4a7a70188582a14ba23653a9329506caf2137d14188791daa5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:52:23,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:52:23,610 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 04:52:23,618 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:52:23,619 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:52:23,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:52:23,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:52:23,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:52:23,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:52:23,643 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:52:23,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:52:23,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:52:23,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:52:23,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:52:23,646 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:52:23,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:52:23,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:52:23,647 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:52:23,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 04:52:23,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:52:23,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:52:23,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:52:23,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:52:23,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:52:23,651 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:52:23,651 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:52:23,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:52:23,652 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:52:23,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:52:23,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:52:23,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:52:23,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:52:23,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:52:23,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:52:23,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:52:23,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:52:23,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 04:52:23,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 04:52:23,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:52:23,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:52:23,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:52:23,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:52:23,656 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 -> e75dd2ef07e59a4a7a70188582a14ba23653a9329506caf2137d14188791daa5 [2024-11-20 04:52:23,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:52:23,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:52:23,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:52:23,895 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:52:23,897 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:52:23,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i [2024-11-20 04:52:25,278 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:52:25,488 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:52:25,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i [2024-11-20 04:52:25,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c1468399/7d7db6dbfc094142900126f00638b8a5/FLAG1ce0cf559 [2024-11-20 04:52:25,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c1468399/7d7db6dbfc094142900126f00638b8a5 [2024-11-20 04:52:25,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:52:25,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:52:25,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:52:25,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:52:25,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:52:25,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:52:25" (1/1) ... [2024-11-20 04:52:25,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b907054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:25, skipping insertion in model container [2024-11-20 04:52:25,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:52:25" (1/1) ... [2024-11-20 04:52:25,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:52:26,034 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-pr-cn_file-9.i[918,931] [2024-11-20 04:52:26,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:52:26,104 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:52:26,113 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-pr-cn_file-9.i[918,931] [2024-11-20 04:52:26,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:52:26,173 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:52:26,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:26 WrapperNode [2024-11-20 04:52:26,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:52:26,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:52:26,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:52:26,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:52:26,180 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:52:26" (1/1) ... [2024-11-20 04:52:26,192 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:52:26" (1/1) ... [2024-11-20 04:52:26,224 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 284 [2024-11-20 04:52:26,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:52:26,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:52:26,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:52:26,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:52:26,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:26" (1/1) ... [2024-11-20 04:52:26,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:26" (1/1) ... [2024-11-20 04:52:26,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:26" (1/1) ... [2024-11-20 04:52:26,259 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:52:26,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:26" (1/1) ... [2024-11-20 04:52:26,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:26" (1/1) ... [2024-11-20 04:52:26,275 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:26" (1/1) ... [2024-11-20 04:52:26,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:26" (1/1) ... [2024-11-20 04:52:26,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:26" (1/1) ... [2024-11-20 04:52:26,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:26" (1/1) ... [2024-11-20 04:52:26,293 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:52:26,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:52:26,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:52:26,294 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:52:26,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:26" (1/1) ... [2024-11-20 04:52:26,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:52:26,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:52:26,320 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:52:26,322 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:52:26,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:52:26,353 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:52:26,353 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:52:26,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 04:52:26,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:52:26,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:52:26,422 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:52:26,423 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:52:26,849 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-20 04:52:26,849 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:52:26,865 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:52:26,865 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:52:26,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:52:26 BoogieIcfgContainer [2024-11-20 04:52:26,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:52:26,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:52:26,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:52:26,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:52:26,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:52:25" (1/3) ... [2024-11-20 04:52:26,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e49e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:52:26, skipping insertion in model container [2024-11-20 04:52:26,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:26" (2/3) ... [2024-11-20 04:52:26,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e49e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:52:26, skipping insertion in model container [2024-11-20 04:52:26,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:52:26" (3/3) ... [2024-11-20 04:52:26,875 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i [2024-11-20 04:52:26,894 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:52:26,894 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:52:26,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:52:26,950 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;@7b46cbce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:52:26,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:52:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 86 states have internal predecessors, (123), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-20 04:52:26,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-20 04:52:26,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:52:26,971 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:26,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:52:26,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:52:26,977 INFO L85 PathProgramCache]: Analyzing trace with hash -813400049, now seen corresponding path program 1 times [2024-11-20 04:52:26,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:52:26,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761589731] [2024-11-20 04:52:26,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:52:26,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:52:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:52:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:52:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:52:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:52:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:52:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:52:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:52:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:52:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:52:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:52:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:52:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:52:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:52:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:52:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:52:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:52:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:52:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:52:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:52:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:52:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:52:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:52:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:52:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 04:52:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:52:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:52:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 04:52:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 04:52:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 04:52:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 04:52:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 04:52:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 04:52:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 04:52:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 04:52:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 04:52:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 04:52:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 04:52:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-20 04:52:27,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:52:27,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761589731] [2024-11-20 04:52:27,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761589731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:52:27,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:52:27,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:52:27,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320558525] [2024-11-20 04:52:27,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:52:27,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:52:27,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:52:27,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:52:27,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:52:27,530 INFO L87 Difference]: Start difference. First operand has 125 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 86 states have internal predecessors, (123), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-20 04:52:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:52:27,594 INFO L93 Difference]: Finished difference Result 243 states and 425 transitions. [2024-11-20 04:52:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:52:27,598 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) Word has length 237 [2024-11-20 04:52:27,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:52:27,606 INFO L225 Difference]: With dead ends: 243 [2024-11-20 04:52:27,606 INFO L226 Difference]: Without dead ends: 121 [2024-11-20 04:52:27,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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:52:27,615 INFO L432 NwaCegarLoop]: 189 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, 189 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:52:27,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:52:27,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-20 04:52:27,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-20 04:52:27,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 82 states have internal predecessors, (115), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-20 04:52:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 189 transitions. [2024-11-20 04:52:27,666 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 189 transitions. Word has length 237 [2024-11-20 04:52:27,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:52:27,667 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 189 transitions. [2024-11-20 04:52:27,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-20 04:52:27,667 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 189 transitions. [2024-11-20 04:52:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-20 04:52:27,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:52:27,673 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:27,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 04:52:27,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:52:27,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:52:27,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1416632431, now seen corresponding path program 1 times [2024-11-20 04:52:27,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:52:27,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649115458] [2024-11-20 04:52:27,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:52:27,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:52:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:52:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:52:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:52:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:52:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:52:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:52:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:27,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:52:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:52:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:52:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:52:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:52:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:52:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:52:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:52:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:52:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:52:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:52:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:52:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:52:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:52:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:52:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:52:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:52:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 04:52:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:52:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:52:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 04:52:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 04:52:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 04:52:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 04:52:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 04:52:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 04:52:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 04:52:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 04:52:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 04:52:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 04:52:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 04:52:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:28,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-20 04:52:28,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:52:28,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649115458] [2024-11-20 04:52:28,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649115458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:52:28,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:52:28,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:52:28,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52055767] [2024-11-20 04:52:28,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:52:28,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:52:28,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:52:28,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:52:28,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:52:28,099 INFO L87 Difference]: Start difference. First operand 121 states and 189 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 04:52:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:52:28,133 INFO L93 Difference]: Finished difference Result 240 states and 377 transitions. [2024-11-20 04:52:28,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:52:28,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 237 [2024-11-20 04:52:28,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:52:28,137 INFO L225 Difference]: With dead ends: 240 [2024-11-20 04:52:28,137 INFO L226 Difference]: Without dead ends: 122 [2024-11-20 04:52:28,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 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:52:28,139 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:52:28,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 371 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:52:28,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-20 04:52:28,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-20 04:52:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 83 states have internal predecessors, (116), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-20 04:52:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 190 transitions. [2024-11-20 04:52:28,154 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 190 transitions. Word has length 237 [2024-11-20 04:52:28,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:52:28,156 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 190 transitions. [2024-11-20 04:52:28,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 04:52:28,157 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 190 transitions. [2024-11-20 04:52:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-20 04:52:28,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:52:28,161 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:28,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 04:52:28,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:52:28,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:52:28,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1662815596, now seen corresponding path program 1 times [2024-11-20 04:52:28,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:52:28,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314480472] [2024-11-20 04:52:28,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:52:28,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:52:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:52:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:52:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:52:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:52:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:52:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:52:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:52:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:52:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:52:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:52:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:52:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:52:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:52:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:52:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:52:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:52:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:52:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:52:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:52:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:52:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:52:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:52:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:52:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 04:52:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:52:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:52:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 04:52:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 04:52:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 04:52:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 04:52:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 04:52:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 04:52:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 04:52:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 04:52:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 04:52:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 04:52:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 04:52:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-20 04:52:31,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:52:31,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314480472] [2024-11-20 04:52:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314480472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:52:31,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:52:31,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 04:52:31,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71100184] [2024-11-20 04:52:31,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:52:31,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 04:52:31,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:52:31,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 04:52:31,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 04:52:31,345 INFO L87 Difference]: Start difference. First operand 122 states and 190 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 04:52:33,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:52:33,248 INFO L93 Difference]: Finished difference Result 351 states and 547 transitions. [2024-11-20 04:52:33,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 04:52:33,249 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 238 [2024-11-20 04:52:33,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:52:33,254 INFO L225 Difference]: With dead ends: 351 [2024-11-20 04:52:33,254 INFO L226 Difference]: Without dead ends: 232 [2024-11-20 04:52:33,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-20 04:52:33,256 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 259 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 04:52:33,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 633 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 04:52:33,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-20 04:52:33,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 165. [2024-11-20 04:52:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 126 states have (on average 1.4841269841269842) internal successors, (187), 126 states have internal predecessors, (187), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-20 04:52:33,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 261 transitions. [2024-11-20 04:52:33,278 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 261 transitions. Word has length 238 [2024-11-20 04:52:33,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:52:33,279 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 261 transitions. [2024-11-20 04:52:33,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 04:52:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 261 transitions. [2024-11-20 04:52:33,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-20 04:52:33,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:52:33,284 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:33,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 04:52:33,285 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:52:33,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:52:33,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1803364206, now seen corresponding path program 1 times [2024-11-20 04:52:33,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:52:33,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704854010] [2024-11-20 04:52:33,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:52:33,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:52:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:52:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:52:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:52:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:52:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:52:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:52:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:52:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:52:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:52:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:52:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:52:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:52:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:52:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:52:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:52:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:52:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:52:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:52:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:52:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:52:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:52:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:52:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:52:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 04:52:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:52:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:52:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 04:52:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 04:52:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 04:52:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 04:52:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 04:52:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 04:52:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 04:52:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 04:52:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 04:52:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 04:52:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 04:52:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-20 04:52:35,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:52:35,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704854010] [2024-11-20 04:52:35,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704854010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:52:35,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:52:35,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 04:52:35,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123241337] [2024-11-20 04:52:35,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:52:35,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 04:52:35,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:52:35,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 04:52:35,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 04:52:35,667 INFO L87 Difference]: Start difference. First operand 165 states and 261 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 04:52:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:52:37,505 INFO L93 Difference]: Finished difference Result 396 states and 620 transitions. [2024-11-20 04:52:37,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 04:52:37,505 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 238 [2024-11-20 04:52:37,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:52:37,507 INFO L225 Difference]: With dead ends: 396 [2024-11-20 04:52:37,507 INFO L226 Difference]: Without dead ends: 234 [2024-11-20 04:52:37,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-20 04:52:37,509 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 206 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 04:52:37,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1012 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 04:52:37,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-20 04:52:37,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 165. [2024-11-20 04:52:37,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 126 states have (on average 1.4841269841269842) internal successors, (187), 126 states have internal predecessors, (187), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-20 04:52:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 261 transitions. [2024-11-20 04:52:37,531 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 261 transitions. Word has length 238 [2024-11-20 04:52:37,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:52:37,532 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 261 transitions. [2024-11-20 04:52:37,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 04:52:37,533 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 261 transitions. [2024-11-20 04:52:37,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-20 04:52:37,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:52:37,536 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:37,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 04:52:37,537 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:52:37,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:52:37,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2122678610, now seen corresponding path program 1 times [2024-11-20 04:52:37,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:52:37,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850798980] [2024-11-20 04:52:37,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:52:37,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:52:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:52:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:52:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:52:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:52:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:52:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:52:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:52:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:52:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:52:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:52:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:52:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:52:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:52:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:52:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:52:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:52:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:52:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:52:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:52:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:52:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:52:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:52:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:52:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 04:52:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:52:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:52:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 04:52:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 04:52:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 04:52:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 04:52:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 04:52:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 04:52:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 04:52:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 04:52:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 04:52:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 04:52:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 04:52:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:38,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-20 04:52:38,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:52:38,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850798980] [2024-11-20 04:52:38,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850798980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:52:38,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:52:38,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 04:52:38,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24823317] [2024-11-20 04:52:38,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:52:38,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 04:52:38,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:52:38,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 04:52:38,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 04:52:38,733 INFO L87 Difference]: Start difference. First operand 165 states and 261 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 04:52:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:52:39,244 INFO L93 Difference]: Finished difference Result 421 states and 667 transitions. [2024-11-20 04:52:39,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 04:52:39,249 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 238 [2024-11-20 04:52:39,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:52:39,252 INFO L225 Difference]: With dead ends: 421 [2024-11-20 04:52:39,253 INFO L226 Difference]: Without dead ends: 259 [2024-11-20 04:52:39,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-20 04:52:39,256 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 206 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 04:52:39,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 745 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 04:52:39,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-20 04:52:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 165. [2024-11-20 04:52:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 126 states have (on average 1.4841269841269842) internal successors, (187), 126 states have internal predecessors, (187), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-20 04:52:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 261 transitions. [2024-11-20 04:52:39,280 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 261 transitions. Word has length 238 [2024-11-20 04:52:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:52:39,281 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 261 transitions. [2024-11-20 04:52:39,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 04:52:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 261 transitions. [2024-11-20 04:52:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-20 04:52:39,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:52:39,284 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:39,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 04:52:39,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:52:39,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:52:39,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1982130000, now seen corresponding path program 1 times [2024-11-20 04:52:39,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:52:39,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568899685] [2024-11-20 04:52:39,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:52:39,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:52:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:52:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:52:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:52:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:52:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:52:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:52:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:52:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:52:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:52:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:52:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:52:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:52:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:52:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:52:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:52:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:52:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:52:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:52:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:52:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:52:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:52:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:52:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:52:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 04:52:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:52:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:52:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 04:52:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 04:52:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 04:52:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 04:52:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 04:52:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 04:52:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 04:52:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 04:52:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 04:52:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 04:52:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 04:52:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-20 04:52:40,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:52:40,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568899685] [2024-11-20 04:52:40,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568899685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:52:40,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:52:40,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 04:52:40,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133367805] [2024-11-20 04:52:40,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:52:40,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 04:52:40,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:52:40,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 04:52:40,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 04:52:40,736 INFO L87 Difference]: Start difference. First operand 165 states and 261 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 04:52:42,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:52:42,344 INFO L93 Difference]: Finished difference Result 503 states and 792 transitions. [2024-11-20 04:52:42,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 04:52:42,345 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 238 [2024-11-20 04:52:42,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:52:42,348 INFO L225 Difference]: With dead ends: 503 [2024-11-20 04:52:42,348 INFO L226 Difference]: Without dead ends: 341 [2024-11-20 04:52:42,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-20 04:52:42,351 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 330 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 04:52:42,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1178 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 04:52:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-20 04:52:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 284. [2024-11-20 04:52:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 207 states have (on average 1.4541062801932367) internal successors, (301), 207 states have internal predecessors, (301), 74 states have call successors, (74), 2 states have call predecessors, (74), 2 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-20 04:52:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 449 transitions. [2024-11-20 04:52:42,372 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 449 transitions. Word has length 238 [2024-11-20 04:52:42,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:52:42,372 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 449 transitions. [2024-11-20 04:52:42,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 04:52:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 449 transitions. [2024-11-20 04:52:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-20 04:52:42,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:52:42,375 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:42,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 04:52:42,376 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:52:42,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:52:42,376 INFO L85 PathProgramCache]: Analyzing trace with hash -484638545, now seen corresponding path program 1 times [2024-11-20 04:52:42,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:52:42,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736165954] [2024-11-20 04:52:42,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:52:42,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:52:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:52:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:52:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:52:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:52:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:52:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:52:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:52:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:52:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:52:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:52:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:52:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:52:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:52:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:52:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:52:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:52:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:52:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:52:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:52:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:52:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:52:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:52:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:52:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 04:52:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:52:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:52:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 04:52:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 04:52:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 04:52:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 04:52:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 04:52:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 04:52:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 04:52:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 04:52:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 04:52:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 04:52:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 04:52:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 18 proven. 90 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-11-20 04:52:42,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:52:42,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736165954] [2024-11-20 04:52:42,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736165954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:52:42,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164729433] [2024-11-20 04:52:42,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:52:42,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:52:42,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:52:42,886 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:52:42,886 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:52:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:43,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 04:52:43,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:52:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-20 04:52:43,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:52:43,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164729433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:52:43,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 04:52:43,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-11-20 04:52:43,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207618274] [2024-11-20 04:52:43,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:52:43,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 04:52:43,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:52:43,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 04:52:43,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2024-11-20 04:52:43,173 INFO L87 Difference]: Start difference. First operand 284 states and 449 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 04:52:43,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:52:43,392 INFO L93 Difference]: Finished difference Result 646 states and 1009 transitions. [2024-11-20 04:52:43,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 04:52:43,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 240 [2024-11-20 04:52:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:52:43,398 INFO L225 Difference]: With dead ends: 646 [2024-11-20 04:52:43,398 INFO L226 Difference]: Without dead ends: 365 [2024-11-20 04:52:43,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2024-11-20 04:52:43,399 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 40 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:52:43,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 816 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 04:52:43,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-20 04:52:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 361. [2024-11-20 04:52:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 278 states have (on average 1.4424460431654675) internal successors, (401), 280 states have internal predecessors, (401), 78 states have call successors, (78), 4 states have call predecessors, (78), 4 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-20 04:52:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 557 transitions. [2024-11-20 04:52:43,425 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 557 transitions. Word has length 240 [2024-11-20 04:52:43,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:52:43,426 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 557 transitions. [2024-11-20 04:52:43,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 04:52:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 557 transitions. [2024-11-20 04:52:43,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-20 04:52:43,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:52:43,428 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:43,436 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:52:43,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:52:43,629 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:52:43,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:52:43,629 INFO L85 PathProgramCache]: Analyzing trace with hash -786403825, now seen corresponding path program 1 times [2024-11-20 04:52:43,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:52:43,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388847023] [2024-11-20 04:52:43,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:52:43,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:52:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:43,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:52:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:43,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:52:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:43,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:52:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:43,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:52:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:43,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:52:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:43,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:52:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:43,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:52:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:43,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:52:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:43,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:52:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:52:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:52:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:52:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:52:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:52:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:52:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:52:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:52:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:52:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:52:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:52:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:52:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:52:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:52:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 04:52:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:52:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:52:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 04:52:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 04:52:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 04:52:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 04:52:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 04:52:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 04:52:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 04:52:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 04:52:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 04:52:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 04:52:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 04:52:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 36 proven. 174 refuted. 0 times theorem prover too weak. 2454 trivial. 0 not checked. [2024-11-20 04:52:44,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:52:44,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388847023] [2024-11-20 04:52:44,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388847023] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:52:44,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236867024] [2024-11-20 04:52:44,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:52:44,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:52:44,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:52:44,078 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:52:44,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 04:52:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:44,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 04:52:44,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:52:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 800 proven. 174 refuted. 0 times theorem prover too weak. 1690 trivial. 0 not checked. [2024-11-20 04:52:45,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:52:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 36 proven. 177 refuted. 0 times theorem prover too weak. 2451 trivial. 0 not checked. [2024-11-20 04:52:45,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236867024] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:52:45,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:52:45,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 26 [2024-11-20 04:52:45,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183247984] [2024-11-20 04:52:45,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:52:45,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-20 04:52:45,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:52:45,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-20 04:52:45,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2024-11-20 04:52:45,612 INFO L87 Difference]: Start difference. First operand 361 states and 557 transitions. Second operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 9 states have call successors, (111), 4 states have call predecessors, (111), 8 states have return successors, (111), 9 states have call predecessors, (111), 9 states have call successors, (111) [2024-11-20 04:52:46,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:52:46,740 INFO L93 Difference]: Finished difference Result 834 states and 1272 transitions. [2024-11-20 04:52:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-20 04:52:46,741 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 9 states have call successors, (111), 4 states have call predecessors, (111), 8 states have return successors, (111), 9 states have call predecessors, (111), 9 states have call successors, (111) Word has length 240 [2024-11-20 04:52:46,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:52:46,746 INFO L225 Difference]: With dead ends: 834 [2024-11-20 04:52:46,746 INFO L226 Difference]: Without dead ends: 476 [2024-11-20 04:52:46,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=487, Invalid=1583, Unknown=0, NotChecked=0, Total=2070 [2024-11-20 04:52:46,748 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 876 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 04:52:46,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 1343 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 04:52:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-20 04:52:46,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 373. [2024-11-20 04:52:46,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 288 states have (on average 1.4305555555555556) internal successors, (412), 290 states have internal predecessors, (412), 78 states have call successors, (78), 6 states have call predecessors, (78), 6 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-20 04:52:46,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 568 transitions. [2024-11-20 04:52:46,769 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 568 transitions. Word has length 240 [2024-11-20 04:52:46,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:52:46,771 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 568 transitions. [2024-11-20 04:52:46,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 9 states have call successors, (111), 4 states have call predecessors, (111), 8 states have return successors, (111), 9 states have call predecessors, (111), 9 states have call successors, (111) [2024-11-20 04:52:46,772 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 568 transitions. [2024-11-20 04:52:46,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-20 04:52:46,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:52:46,773 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:46,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 04:52:46,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-20 04:52:46,978 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:52:46,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:52:46,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1585335437, now seen corresponding path program 1 times [2024-11-20 04:52:46,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:52:46,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861849798] [2024-11-20 04:52:46,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:52:46,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:52:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 04:52:47,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991537473] [2024-11-20 04:52:47,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:52:47,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:52:47,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:52:47,062 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:52:47,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 04:52:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:47,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 04:52:47,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:52:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 556 proven. 96 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2024-11-20 04:52:47,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:52:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 12 proven. 96 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-11-20 04:52:47,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:52:47,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861849798] [2024-11-20 04:52:47,816 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 04:52:47,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991537473] [2024-11-20 04:52:47,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991537473] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:52:47,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 04:52:47,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-20 04:52:47,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970601050] [2024-11-20 04:52:47,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 04:52:47,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 04:52:47,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:52:47,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 04:52:47,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-20 04:52:47,818 INFO L87 Difference]: Start difference. First operand 373 states and 568 transitions. Second operand has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 3 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) [2024-11-20 04:52:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:52:48,547 INFO L93 Difference]: Finished difference Result 1073 states and 1615 transitions. [2024-11-20 04:52:48,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 04:52:48,548 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 3 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) Word has length 240 [2024-11-20 04:52:48,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:52:48,552 INFO L225 Difference]: With dead ends: 1073 [2024-11-20 04:52:48,552 INFO L226 Difference]: Without dead ends: 703 [2024-11-20 04:52:48,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-11-20 04:52:48,555 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 433 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 04:52:48,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1120 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 04:52:48,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-11-20 04:52:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 568. [2024-11-20 04:52:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 481 states have (on average 1.496881496881497) internal successors, (720), 483 states have internal predecessors, (720), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-20 04:52:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 876 transitions. [2024-11-20 04:52:48,589 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 876 transitions. Word has length 240 [2024-11-20 04:52:48,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:52:48,590 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 876 transitions. [2024-11-20 04:52:48,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 3 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) [2024-11-20 04:52:48,590 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 876 transitions. [2024-11-20 04:52:48,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-20 04:52:48,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:52:48,591 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:48,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 04:52:48,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:52:48,792 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:52:48,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:52:48,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1165257572, now seen corresponding path program 1 times [2024-11-20 04:52:48,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:52:48,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009726734] [2024-11-20 04:52:48,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:52:48,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:52:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:52:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:52:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:52:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:52:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:52:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:52:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:52:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:52:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:52:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:52:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:52:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:52:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:52:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:52:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:52:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:52:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:52:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:52:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:52:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:52:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:52:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:52:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:52:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 04:52:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:52:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:52:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 04:52:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 04:52:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 04:52:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 04:52:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 04:52:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 04:52:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 04:52:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 04:52:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 04:52:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 04:52:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 04:52:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-20 04:52:48,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:52:48,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009726734] [2024-11-20 04:52:48,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009726734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:52:48,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:52:48,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:52:48,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633032499] [2024-11-20 04:52:48,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:52:48,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:52:48,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:52:48,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:52:48,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:52:48,907 INFO L87 Difference]: Start difference. First operand 568 states and 876 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 04:52:48,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:52:48,986 INFO L93 Difference]: Finished difference Result 1313 states and 2008 transitions. [2024-11-20 04:52:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:52:48,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 240 [2024-11-20 04:52:48,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:52:48,991 INFO L225 Difference]: With dead ends: 1313 [2024-11-20 04:52:48,991 INFO L226 Difference]: Without dead ends: 748 [2024-11-20 04:52:48,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 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:52:48,994 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 164 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:52:48,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 395 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:52:48,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2024-11-20 04:52:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 726. [2024-11-20 04:52:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 557 states have (on average 1.4254937163375225) internal successors, (794), 561 states have internal predecessors, (794), 152 states have call successors, (152), 16 states have call predecessors, (152), 16 states have return successors, (152), 148 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-20 04:52:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1098 transitions. [2024-11-20 04:52:49,035 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1098 transitions. Word has length 240 [2024-11-20 04:52:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:52:49,036 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1098 transitions. [2024-11-20 04:52:49,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 04:52:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1098 transitions. [2024-11-20 04:52:49,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-20 04:52:49,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:52:49,037 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:49,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 04:52:49,037 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:52:49,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:52:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash -553882130, now seen corresponding path program 1 times [2024-11-20 04:52:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:52:49,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155285740] [2024-11-20 04:52:49,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:52:49,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:52:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:52:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:52:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:52:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:52:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:52:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:52:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:52:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:52:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:52:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:52:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:52:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:52:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:52:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:52:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:52:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:52:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:52:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:52:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:52:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:52:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:52:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:52:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:52:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 04:52:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:52:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:52:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 04:52:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 04:52:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 04:52:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 04:52:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 04:52:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 04:52:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 04:52:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 04:52:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 04:52:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 04:52:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 04:52:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-20 04:52:51,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:52:51,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155285740] [2024-11-20 04:52:51,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155285740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:52:51,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:52:51,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-20 04:52:51,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636158794] [2024-11-20 04:52:51,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:52:51,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 04:52:51,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:52:51,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 04:52:51,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-20 04:52:51,889 INFO L87 Difference]: Start difference. First operand 726 states and 1098 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 04:52:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:52:54,344 INFO L93 Difference]: Finished difference Result 1278 states and 1928 transitions. [2024-11-20 04:52:54,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-20 04:52:54,345 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 241 [2024-11-20 04:52:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:52:54,350 INFO L225 Difference]: With dead ends: 1278 [2024-11-20 04:52:54,351 INFO L226 Difference]: Without dead ends: 1276 [2024-11-20 04:52:54,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2024-11-20 04:52:54,352 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 545 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:52:54,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1979 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 04:52:54,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2024-11-20 04:52:54,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 897. [2024-11-20 04:52:54,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 728 states have (on average 1.4697802197802199) internal successors, (1070), 732 states have internal predecessors, (1070), 152 states have call successors, (152), 16 states have call predecessors, (152), 16 states have return successors, (152), 148 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-20 04:52:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1374 transitions. [2024-11-20 04:52:54,415 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1374 transitions. Word has length 241 [2024-11-20 04:52:54,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:52:54,416 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 1374 transitions. [2024-11-20 04:52:54,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 04:52:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1374 transitions. [2024-11-20 04:52:54,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-20 04:52:54,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:52:54,418 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:54,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 04:52:54,418 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:52:54,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:52:54,419 INFO L85 PathProgramCache]: Analyzing trace with hash -694430740, now seen corresponding path program 1 times [2024-11-20 04:52:54,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:52:54,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442961683] [2024-11-20 04:52:54,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:52:54,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:52:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:52:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:52:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:52:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:52:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:52:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:52:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:52:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:52:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 04:52:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:52:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:52:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:52:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:52:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:52:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:52:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:52:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:52:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:52:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:52:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:52:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:52:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:52:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:52:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 04:52:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:52:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:52:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 04:52:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 04:52:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 04:52:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 04:52:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 04:52:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 04:52:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 04:52:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 04:52:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 04:52:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 04:52:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 04:52:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:52:54,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-20 04:52:54,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:52:54,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442961683] [2024-11-20 04:52:54,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442961683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:52:54,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:52:54,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 04:52:54,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181450008] [2024-11-20 04:52:54,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:52:54,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 04:52:54,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:52:54,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 04:52:54,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 04:52:54,723 INFO L87 Difference]: Start difference. First operand 897 states and 1374 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-20 04:52:55,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:52:55,011 INFO L93 Difference]: Finished difference Result 2332 states and 3565 transitions. [2024-11-20 04:52:55,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 04:52:55,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 241 [2024-11-20 04:52:55,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:52:55,019 INFO L225 Difference]: With dead ends: 2332 [2024-11-20 04:52:55,019 INFO L226 Difference]: Without dead ends: 1438 [2024-11-20 04:52:55,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-20 04:52:55,022 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 243 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:52:55,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 483 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 04:52:55,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2024-11-20 04:52:55,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1041. [2024-11-20 04:52:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 872 states have (on average 1.4908256880733946) internal successors, (1300), 876 states have internal predecessors, (1300), 152 states have call successors, (152), 16 states have call predecessors, (152), 16 states have return successors, (152), 148 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-20 04:52:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1604 transitions. [2024-11-20 04:52:55,094 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1604 transitions. Word has length 241 [2024-11-20 04:52:55,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:52:55,095 INFO L471 AbstractCegarLoop]: Abstraction has 1041 states and 1604 transitions. [2024-11-20 04:52:55,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-20 04:52:55,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1604 transitions. [2024-11-20 04:52:55,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-20 04:52:55,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:52:55,098 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:55,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 04:52:55,099 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:52:55,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:52:55,099 INFO L85 PathProgramCache]: Analyzing trace with hash -817728191, now seen corresponding path program 1 times [2024-11-20 04:52:55,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:52:55,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677484459] [2024-11-20 04:52:55,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:52:55,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:52:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 04:52:55,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1080269452] [2024-11-20 04:52:55,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:52:55,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:52:55,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:52:55,209 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:52:55,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 04:52:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:52:55,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 04:52:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:52:55,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 04:52:55,578 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 04:52:55,579 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 04:52:55,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 04:52:55,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:52:55,788 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:52:55,882 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 04:52:55,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:52:55 BoogieIcfgContainer [2024-11-20 04:52:55,885 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 04:52:55,885 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 04:52:55,886 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 04:52:55,886 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 04:52:55,886 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:52:26" (3/4) ... [2024-11-20 04:52:55,888 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 04:52:55,889 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 04:52:55,890 INFO L158 Benchmark]: Toolchain (without parser) took 30041.53ms. Allocated memory was 163.6MB in the beginning and 520.1MB in the end (delta: 356.5MB). Free memory was 89.5MB in the beginning and 370.8MB in the end (delta: -281.3MB). Peak memory consumption was 75.7MB. Max. memory is 16.1GB. [2024-11-20 04:52:55,890 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 163.6MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:52:55,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.01ms. Allocated memory is still 163.6MB. Free memory was 89.3MB in the beginning and 71.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 04:52:55,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.14ms. Allocated memory is still 163.6MB. Free memory was 71.7MB in the beginning and 67.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 04:52:55,890 INFO L158 Benchmark]: Boogie Preprocessor took 67.96ms. Allocated memory is still 163.6MB. Free memory was 67.8MB in the beginning and 63.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 04:52:55,891 INFO L158 Benchmark]: RCFGBuilder took 572.68ms. Allocated memory is still 163.6MB. Free memory was 63.6MB in the beginning and 109.2MB in the end (delta: -45.7MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2024-11-20 04:52:55,891 INFO L158 Benchmark]: TraceAbstraction took 29017.44ms. Allocated memory was 163.6MB in the beginning and 520.1MB in the end (delta: 356.5MB). Free memory was 108.2MB in the beginning and 370.8MB in the end (delta: -262.6MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. [2024-11-20 04:52:55,891 INFO L158 Benchmark]: Witness Printer took 3.83ms. Allocated memory is still 520.1MB. Free memory is still 370.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:52:55,892 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.13ms. Allocated memory is still 163.6MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.01ms. Allocated memory is still 163.6MB. Free memory was 89.3MB in the beginning and 71.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.14ms. Allocated memory is still 163.6MB. Free memory was 71.7MB in the beginning and 67.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.96ms. Allocated memory is still 163.6MB. Free memory was 67.8MB in the beginning and 63.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 572.68ms. Allocated memory is still 163.6MB. Free memory was 63.6MB in the beginning and 109.2MB in the end (delta: -45.7MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * TraceAbstraction took 29017.44ms. Allocated memory was 163.6MB in the beginning and 520.1MB in the end (delta: 356.5MB). Free memory was 108.2MB in the beginning and 370.8MB in the end (delta: -262.6MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. * Witness Printer took 3.83ms. Allocated memory is still 520.1MB. Free memory is still 370.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of shiftLeft at line 207, overapproximation of someUnaryDOUBLEoperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 207. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned long int var_1_19 = 50; [L37] unsigned char var_1_20 = 0; [L38] unsigned char var_1_21 = 0; [L39] unsigned long int var_1_22 = 0; [L40] unsigned char var_1_23 = 64; [L41] unsigned char var_1_24 = 64; [L42] unsigned char var_1_25 = 2; [L43] unsigned short int var_1_26 = 32; [L44] unsigned long int var_1_27 = 100; [L45] unsigned short int var_1_28 = 64; [L46] float var_1_29 = 499.875; [L47] float var_1_30 = -0.2; [L48] float var_1_31 = 7.4; [L49] float var_1_32 = -0.375; [L50] float var_1_33 = 1.4; [L51] float var_1_34 = 200.4; [L52] float var_1_35 = 1.5; [L53] unsigned char var_1_36 = 0; [L54] unsigned char last_1_var_1_10 = 32; [L55] unsigned short int last_1_var_1_12 = 16; [L56] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L211] isInitial = 1 [L212] FCALL initially() [L213] COND TRUE 1 [L214] CALL updateLastVariables() [L202] last_1_var_1_10 = var_1_10 [L203] last_1_var_1_12 = var_1_12 [L204] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L214] RET updateLastVariables() [L215] CALL updateVariables() [L143] var_1_3 = __VERIFIER_nondet_short() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L145] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L145] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L146] var_1_5 = __VERIFIER_nondet_long() [L147] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L147] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L148] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L148] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L149] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L149] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L150] var_1_6 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L151] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L152] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L152] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L153] var_1_7 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L154] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L155] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L155] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L156] var_1_8 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_9=9/5] [L157] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_9=9/5] [L158] var_1_9 = __VERIFIER_nondet_double() [L159] 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, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L159] 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, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L160] var_1_11 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L161] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L162] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L162] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L163] var_1_15 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L164] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L165] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L165] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L166] var_1_20 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L167] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L168] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L168] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L169] var_1_21 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L170] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L171] CALL assume_abort_if_not(var_1_21 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L171] RET assume_abort_if_not(var_1_21 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L172] var_1_22 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L173] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L174] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L174] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L175] var_1_24 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L176] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L177] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L177] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L178] var_1_25 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L179] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L180] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L180] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L181] var_1_27 = __VERIFIER_nondet_ulong() [L182] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L182] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L183] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L183] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L184] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L184] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L185] var_1_29 = __VERIFIER_nondet_float() [L186] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L186] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L187] var_1_30 = __VERIFIER_nondet_float() [L188] CALL assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L188] RET assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L189] CALL assume_abort_if_not(var_1_30 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L189] RET assume_abort_if_not(var_1_30 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L190] var_1_31 = __VERIFIER_nondet_float() [L191] CALL assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L191] RET assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L192] var_1_32 = __VERIFIER_nondet_float() [L193] CALL assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L193] RET assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L194] CALL assume_abort_if_not(var_1_32 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L194] RET assume_abort_if_not(var_1_32 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L195] var_1_34 = __VERIFIER_nondet_float() [L196] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L196] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L197] var_1_36 = __VERIFIER_nondet_uchar() [L198] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L198] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L199] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L199] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L215] RET updateVariables() [L216] CALL step() [L60] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L61] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L63] COND FALSE !(((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) == (~ 16u)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L68] var_1_33 = var_1_34 [L69] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L70] COND TRUE var_1_6 <= stepLocal_2 [L71] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L75] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L75] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L82] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L84] var_1_18 = var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L85] COND TRUE var_1_22 <= var_1_19 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L86] COND TRUE var_1_22 <= (((((var_1_25) < (var_1_24)) ? (var_1_25) : (var_1_24))) / var_1_27) [L87] var_1_26 = ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L100] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L101] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L102] COND FALSE !((- var_1_9) <= var_1_8) [L115] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L117] COND FALSE !((var_1_29 / var_1_30) > ((((var_1_31 / var_1_32) < 0 ) ? -(var_1_31 / var_1_32) : (var_1_31 / var_1_32)))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L122] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L123] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L123] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L124] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L131] COND TRUE var_1_20 || var_1_21 [L132] var_1_19 = ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=254, var_1_18=0, var_1_19=4294967296, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L134] COND FALSE !(((256 - var_1_25) <= (var_1_28 + var_1_19)) || var_1_20) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=254, var_1_18=0, var_1_19=4294967296, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L216] RET step() [L217] CALL, EXPR property() [L207] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=254, var_1_18=0, var_1_19=4294967296, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L207] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=254, var_1_18=0, var_1_19=4294967296, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L207] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=254, var_1_18=0, var_1_19=4294967296, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L207] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=254, var_1_18=0, var_1_19=4294967296, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L207] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=254, var_1_18=0, var_1_19=4294967296, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L207-L208] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L217] RET, EXPR property() [L217] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=254, var_1_18=0, var_1_19=4294967296, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=-255, var_1_16=254, var_1_18=0, var_1_19=4294967296, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=4294967296, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.9s, OverallIterations: 13, TraceHistogramMax: 37, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3309 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3302 mSDsluCounter, 10264 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7786 mSDsCounter, 330 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4497 IncrementalHoareTripleChecker+Invalid, 4827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 330 mSolverCounterUnsat, 2478 mSDtfsCounter, 4497 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2194 GetRequests, 2047 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1041occurred in iteration=12, InterpolantAutomatonStates: 115, 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, 12 MinimizatonAttempts, 1327 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 4070 NumberOfCodeBlocks, 4070 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3812 ConstructedInterpolants, 0 QuantifiedInterpolants, 17490 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1589 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 41817/42624 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:52:55,973 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-pr-cn_file-9.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 e75dd2ef07e59a4a7a70188582a14ba23653a9329506caf2137d14188791daa5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:52:57,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:52:58,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 04:52:58,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:52:58,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:52:58,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:52:58,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:52:58,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:52:58,084 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:52:58,085 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:52:58,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:52:58,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:52:58,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:52:58,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:52:58,088 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:52:58,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:52:58,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:52:58,089 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:52:58,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:52:58,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:52:58,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:52:58,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:52:58,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:52:58,094 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 04:52:58,094 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 04:52:58,095 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:52:58,095 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 04:52:58,095 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:52:58,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:52:58,095 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:52:58,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:52:58,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:52:58,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:52:58,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:52:58,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:52:58,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:52:58,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:52:58,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:52:58,098 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 04:52:58,099 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 04:52:58,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:52:58,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:52:58,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:52:58,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:52:58,100 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 -> e75dd2ef07e59a4a7a70188582a14ba23653a9329506caf2137d14188791daa5 [2024-11-20 04:52:58,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:52:58,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:52:58,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:52:58,415 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:52:58,415 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:52:58,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i [2024-11-20 04:52:59,717 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:52:59,904 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:52:59,904 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i [2024-11-20 04:52:59,912 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d6637ee/137ed6ea14de4796940e5671e5e15681/FLAG0291ac1da [2024-11-20 04:53:00,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d6637ee/137ed6ea14de4796940e5671e5e15681 [2024-11-20 04:53:00,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:53:00,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:53:00,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:53:00,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:53:00,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:53:00,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:53:00" (1/1) ... [2024-11-20 04:53:00,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f064c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:53:00, skipping insertion in model container [2024-11-20 04:53:00,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:53:00" (1/1) ... [2024-11-20 04:53:00,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:53:00,465 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-pr-cn_file-9.i[918,931] [2024-11-20 04:53:00,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:53:00,565 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:53:00,576 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-pr-cn_file-9.i[918,931] [2024-11-20 04:53:00,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:53:00,628 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:53:00,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:53:00 WrapperNode [2024-11-20 04:53:00,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:53:00,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:53:00,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:53:00,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:53:00,637 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:53:00" (1/1) ... [2024-11-20 04:53:00,655 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:53:00" (1/1) ... [2024-11-20 04:53:00,701 INFO L138 Inliner]: procedures = 27, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 218 [2024-11-20 04:53:00,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:53:00,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:53:00,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:53:00,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:53:00,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:53:00" (1/1) ... [2024-11-20 04:53:00,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:53:00" (1/1) ... [2024-11-20 04:53:00,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:53:00" (1/1) ... [2024-11-20 04:53:00,734 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:53:00,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:53:00" (1/1) ... [2024-11-20 04:53:00,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:53:00" (1/1) ... [2024-11-20 04:53:00,743 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:53:00" (1/1) ... [2024-11-20 04:53:00,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:53:00" (1/1) ... [2024-11-20 04:53:00,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:53:00" (1/1) ... [2024-11-20 04:53:00,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:53:00" (1/1) ... [2024-11-20 04:53:00,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:53:00,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:53:00,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:53:00,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:53:00,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:53:00" (1/1) ... [2024-11-20 04:53:00,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:53:00,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:53:00,795 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:53:00,797 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:53:00,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:53:00,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 04:53:00,829 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:53:00,830 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:53:00,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:53:00,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:53:00,904 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:53:00,906 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:53:06,757 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-20 04:53:06,757 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:53:06,773 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:53:06,774 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:53:06,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:53:06 BoogieIcfgContainer [2024-11-20 04:53:06,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:53:06,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:53:06,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:53:06,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:53:06,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:53:00" (1/3) ... [2024-11-20 04:53:06,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56068c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:53:06, skipping insertion in model container [2024-11-20 04:53:06,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:53:00" (2/3) ... [2024-11-20 04:53:06,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56068c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:53:06, skipping insertion in model container [2024-11-20 04:53:06,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:53:06" (3/3) ... [2024-11-20 04:53:06,783 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i [2024-11-20 04:53:06,797 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:53:06,797 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:53:06,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:53:06,854 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;@7b75efe7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:53:06,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:53:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-20 04:53:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-20 04:53:06,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:53:06,871 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:06,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:53:06,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:53:06,876 INFO L85 PathProgramCache]: Analyzing trace with hash -841352604, now seen corresponding path program 1 times [2024-11-20 04:53:06,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:53:06,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715478825] [2024-11-20 04:53:06,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:53:06,888 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:53:06,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:53:06,894 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:53:06,914 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:53:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:53:07,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 04:53:07,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:53:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 884 proven. 0 refuted. 0 times theorem prover too weak. 1780 trivial. 0 not checked. [2024-11-20 04:53:07,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:53:07,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:53:07,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715478825] [2024-11-20 04:53:07,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715478825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:53:07,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:53:07,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:53:07,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662420494] [2024-11-20 04:53:07,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:53:07,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:53:07,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:53:07,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:53:07,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:53:07,697 INFO L87 Difference]: Start difference. First operand has 102 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) 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, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-20 04:53:07,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:53:07,730 INFO L93 Difference]: Finished difference Result 197 states and 357 transitions. [2024-11-20 04:53:07,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:53:07,734 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, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 229 [2024-11-20 04:53:07,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:53:07,742 INFO L225 Difference]: With dead ends: 197 [2024-11-20 04:53:07,742 INFO L226 Difference]: Without dead ends: 98 [2024-11-20 04:53:07,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 228 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:53:07,749 INFO L432 NwaCegarLoop]: 155 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, 155 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:53:07,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:53:07,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-20 04:53:07,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-20 04:53:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-20 04:53:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 155 transitions. [2024-11-20 04:53:07,800 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 155 transitions. Word has length 229 [2024-11-20 04:53:07,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:53:07,800 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 155 transitions. [2024-11-20 04:53:07,800 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, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-20 04:53:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 155 transitions. [2024-11-20 04:53:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-20 04:53:07,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:53:07,804 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:07,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 04:53:08,005 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:53:08,005 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:53:08,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:53:08,006 INFO L85 PathProgramCache]: Analyzing trace with hash -431395630, now seen corresponding path program 1 times [2024-11-20 04:53:08,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:53:08,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686046892] [2024-11-20 04:53:08,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:53:08,007 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:53:08,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:53:08,010 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:53:08,011 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:53:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:53:08,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 04:53:08,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:53:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 771 proven. 336 refuted. 0 times theorem prover too weak. 1557 trivial. 0 not checked. [2024-11-20 04:53:19,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:53:21,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:53:21,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686046892] [2024-11-20 04:53:21,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686046892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:53:21,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [557316630] [2024-11-20 04:53:21,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:53:21,727 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 04:53:21,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 04:53:21,730 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 04:53:21,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-20 04:53:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:53:23,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 04:53:23,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:53:30,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 734 proven. 261 refuted. 0 times theorem prover too weak. 1669 trivial. 0 not checked. [2024-11-20 04:53:30,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:53:32,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [557316630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:53:32,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 04:53:32,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 17 [2024-11-20 04:53:32,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133546205] [2024-11-20 04:53:32,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 04:53:32,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 04:53:32,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:53:32,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 04:53:32,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2024-11-20 04:53:32,084 INFO L87 Difference]: Start difference. First operand 98 states and 155 transitions. Second operand has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 16 states have internal predecessors, (87), 5 states have call successors, (65), 5 states have call predecessors, (65), 7 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66) [2024-11-20 04:53:37,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:53:37,973 INFO L93 Difference]: Finished difference Result 338 states and 525 transitions. [2024-11-20 04:53:37,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-20 04:53:37,980 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 16 states have internal predecessors, (87), 5 states have call successors, (65), 5 states have call predecessors, (65), 7 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66) Word has length 230 [2024-11-20 04:53:37,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:53:37,984 INFO L225 Difference]: With dead ends: 338 [2024-11-20 04:53:37,984 INFO L226 Difference]: Without dead ends: 243 [2024-11-20 04:53:37,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 801 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=427, Invalid=1295, Unknown=0, NotChecked=0, Total=1722 [2024-11-20 04:53:37,986 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 240 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:53:37,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1088 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-20 04:53:37,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-20 04:53:38,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 211. [2024-11-20 04:53:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 130 states have (on average 1.3461538461538463) internal successors, (175), 130 states have internal predecessors, (175), 74 states have call successors, (74), 6 states have call predecessors, (74), 6 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-20 04:53:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 323 transitions. [2024-11-20 04:53:38,034 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 323 transitions. Word has length 230 [2024-11-20 04:53:38,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:53:38,035 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 323 transitions. [2024-11-20 04:53:38,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 16 states have internal predecessors, (87), 5 states have call successors, (65), 5 states have call predecessors, (65), 7 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66) [2024-11-20 04:53:38,035 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 323 transitions. [2024-11-20 04:53:38,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-20 04:53:38,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:53:38,042 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:38,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-20 04:53:38,264 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:53:38,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:53:38,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:53:38,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:53:38,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1156952272, now seen corresponding path program 1 times [2024-11-20 04:53:38,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:53:38,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334951936] [2024-11-20 04:53:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:53:38,445 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:53:38,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:53:38,448 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:53:38,449 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:53:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:53:39,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-20 04:53:39,035 INFO L278 TraceCheckSpWp]: Computing forward predicates...