./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-92.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 1647212ce4f3f4f9fd50f26c58789c1b74cae78fef7c8c598be9f288d0b5bbff --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:43:07,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:43:07,561 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:43:07,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:43:07,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:43:07,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:43:07,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:43:07,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:43:07,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:43:07,616 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:43:07,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:43:07,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:43:07,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:43:07,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:43:07,625 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:43:07,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:43:07,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:43:07,626 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:43:07,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:43:07,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:43:07,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:43:07,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:43:07,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:43:07,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:43:07,628 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:43:07,628 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:43:07,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:43:07,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:43:07,631 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:43:07,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:43:07,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:43:07,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:43:07,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:43:07,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:43:07,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:43:07,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:43:07,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:43:07,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:43:07,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:43:07,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:43:07,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:43:07,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:43:07,642 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 -> 1647212ce4f3f4f9fd50f26c58789c1b74cae78fef7c8c598be9f288d0b5bbff [2024-11-08 22:43:07,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:43:07,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:43:07,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:43:07,927 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:43:07,928 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:43:07,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i [2024-11-08 22:43:09,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:43:09,655 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:43:09,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i [2024-11-08 22:43:09,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1187ed1/74aca92e15be4c85a40d3ebeea8e6111/FLAG13cb9935f [2024-11-08 22:43:09,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1187ed1/74aca92e15be4c85a40d3ebeea8e6111 [2024-11-08 22:43:09,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:43:09,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:43:09,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:43:09,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:43:09,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:43:09,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:43:09" (1/1) ... [2024-11-08 22:43:09,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@393ef8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:09, skipping insertion in model container [2024-11-08 22:43:09,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:43:09" (1/1) ... [2024-11-08 22:43:09,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:43:09,933 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-ps-co_file-92.i[919,932] [2024-11-08 22:43:10,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:43:10,028 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:43:10,048 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-ps-co_file-92.i[919,932] [2024-11-08 22:43:10,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:43:10,120 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:43:10,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:10 WrapperNode [2024-11-08 22:43:10,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:43:10,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:43:10,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:43:10,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:43:10,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:10" (1/1) ... [2024-11-08 22:43:10,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:10" (1/1) ... [2024-11-08 22:43:10,188 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 263 [2024-11-08 22:43:10,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:43:10,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:43:10,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:43:10,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:43:10,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:10" (1/1) ... [2024-11-08 22:43:10,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:10" (1/1) ... [2024-11-08 22:43:10,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:10" (1/1) ... [2024-11-08 22:43:10,226 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:43:10,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:10" (1/1) ... [2024-11-08 22:43:10,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:10" (1/1) ... [2024-11-08 22:43:10,250 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:10" (1/1) ... [2024-11-08 22:43:10,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:10" (1/1) ... [2024-11-08 22:43:10,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:10" (1/1) ... [2024-11-08 22:43:10,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:10" (1/1) ... [2024-11-08 22:43:10,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:43:10,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:43:10,281 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:43:10,281 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:43:10,282 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:10" (1/1) ... [2024-11-08 22:43:10,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:43:10,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:43:10,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:43:10,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:43:10,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:43:10,373 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:43:10,374 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:43:10,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:43:10,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:43:10,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:43:10,492 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:43:10,495 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:43:11,090 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 22:43:11,091 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:43:11,109 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:43:11,110 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:43:11,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:43:11 BoogieIcfgContainer [2024-11-08 22:43:11,110 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:43:11,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:43:11,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:43:11,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:43:11,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:43:09" (1/3) ... [2024-11-08 22:43:11,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194c949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:43:11, skipping insertion in model container [2024-11-08 22:43:11,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:10" (2/3) ... [2024-11-08 22:43:11,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194c949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:43:11, skipping insertion in model container [2024-11-08 22:43:11,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:43:11" (3/3) ... [2024-11-08 22:43:11,124 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i [2024-11-08 22:43:11,143 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:43:11,144 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:43:11,219 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:43:11,228 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;@64f78344, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:43:11,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:43:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 74 states have internal predecessors, (105), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-08 22:43:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 22:43:11,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:43:11,252 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:43:11,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:43:11,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:43:11,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1749041708, now seen corresponding path program 1 times [2024-11-08 22:43:11,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:43:11,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679866698] [2024-11-08 22:43:11,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:43:11,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:43:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:43:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:43:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:43:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:43:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:43:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:43:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:43:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:43:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:43:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:43:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:43:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:43:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:43:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:43:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:43:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:43:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:43:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:43:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:43:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:43:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:43:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:43:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:43:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:43:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:43:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:43:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:43:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:43:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 22:43:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 22:43:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 22:43:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 22:43:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 22:43:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-08 22:43:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-08 22:43:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 22:43:11,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:43:11,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679866698] [2024-11-08 22:43:11,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679866698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:43:11,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:43:11,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:43:11,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117605257] [2024-11-08 22:43:11,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:43:11,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:43:11,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:43:11,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:43:11,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:43:11,978 INFO L87 Difference]: Start difference. First operand has 111 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 74 states have internal predecessors, (105), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-08 22:43:12,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:43:12,018 INFO L93 Difference]: Finished difference Result 215 states and 379 transitions. [2024-11-08 22:43:12,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:43:12,021 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 223 [2024-11-08 22:43:12,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:43:12,029 INFO L225 Difference]: With dead ends: 215 [2024-11-08 22:43:12,030 INFO L226 Difference]: Without dead ends: 107 [2024-11-08 22:43:12,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:43:12,041 INFO L432 NwaCegarLoop]: 168 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, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:43:12,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:43:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-08 22:43:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-08 22:43:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-08 22:43:12,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 168 transitions. [2024-11-08 22:43:12,099 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 168 transitions. Word has length 223 [2024-11-08 22:43:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:43:12,100 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 168 transitions. [2024-11-08 22:43:12,100 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-08 22:43:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 168 transitions. [2024-11-08 22:43:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 22:43:12,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:43:12,106 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:43:12,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:43:12,107 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:43:12,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:43:12,107 INFO L85 PathProgramCache]: Analyzing trace with hash -307866738, now seen corresponding path program 1 times [2024-11-08 22:43:12,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:43:12,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614390807] [2024-11-08 22:43:12,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:43:12,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:43:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:43:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:43:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:43:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:43:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:43:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:43:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:43:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:43:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:43:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:43:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:43:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:43:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:43:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:43:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:43:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:43:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:43:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:43:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:43:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:43:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:43:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:43:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:43:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:43:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:43:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:43:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:43:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:43:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 22:43:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 22:43:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 22:43:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 22:43:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 22:43:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-08 22:43:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-08 22:43:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 22:43:12,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:43:12,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614390807] [2024-11-08 22:43:12,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614390807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:43:12,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:43:12,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:43:12,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312149701] [2024-11-08 22:43:12,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:43:12,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:43:12,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:43:12,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:43:12,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:43:12,903 INFO L87 Difference]: Start difference. First operand 107 states and 168 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:13,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:43:13,051 INFO L93 Difference]: Finished difference Result 300 states and 479 transitions. [2024-11-08 22:43:13,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:43:13,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2024-11-08 22:43:13,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:43:13,061 INFO L225 Difference]: With dead ends: 300 [2024-11-08 22:43:13,062 INFO L226 Difference]: Without dead ends: 196 [2024-11-08 22:43:13,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:43:13,065 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 82 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:43:13,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 460 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:43:13,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-08 22:43:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 173. [2024-11-08 22:43:13,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 22:43:13,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 271 transitions. [2024-11-08 22:43:13,118 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 271 transitions. Word has length 223 [2024-11-08 22:43:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:43:13,119 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 271 transitions. [2024-11-08 22:43:13,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 271 transitions. [2024-11-08 22:43:13,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 22:43:13,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:43:13,126 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:43:13,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:43:13,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:43:13,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:43:13,127 INFO L85 PathProgramCache]: Analyzing trace with hash 114835088, now seen corresponding path program 1 times [2024-11-08 22:43:13,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:43:13,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855125729] [2024-11-08 22:43:13,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:43:13,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:43:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:43:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:43:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:43:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:43:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:43:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:43:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:43:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:43:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:43:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:43:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:43:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:43:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:43:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:43:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:43:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:43:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:43:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:43:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:43:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:43:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:43:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:43:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:43:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:43:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:43:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:43:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:43:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:43:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 22:43:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 22:43:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 22:43:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 22:43:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 22:43:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-08 22:43:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-08 22:43:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 22:43:13,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:43:13,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855125729] [2024-11-08 22:43:13,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855125729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:43:13,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:43:13,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:43:13,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202972192] [2024-11-08 22:43:13,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:43:13,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:43:13,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:43:13,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:43:13,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:43:13,649 INFO L87 Difference]: Start difference. First operand 173 states and 271 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:13,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:43:13,740 INFO L93 Difference]: Finished difference Result 298 states and 472 transitions. [2024-11-08 22:43:13,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:43:13,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2024-11-08 22:43:13,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:43:13,744 INFO L225 Difference]: With dead ends: 298 [2024-11-08 22:43:13,744 INFO L226 Difference]: Without dead ends: 194 [2024-11-08 22:43:13,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:43:13,746 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 76 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:43:13,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 297 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:43:13,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-08 22:43:13,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2024-11-08 22:43:13,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 22:43:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 275 transitions. [2024-11-08 22:43:13,775 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 275 transitions. Word has length 223 [2024-11-08 22:43:13,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:43:13,776 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 275 transitions. [2024-11-08 22:43:13,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:13,777 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 275 transitions. [2024-11-08 22:43:13,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-08 22:43:13,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:43:13,780 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:43:13,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:43:13,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:43:13,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:43:13,781 INFO L85 PathProgramCache]: Analyzing trace with hash -580355067, now seen corresponding path program 1 times [2024-11-08 22:43:13,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:43:13,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241462532] [2024-11-08 22:43:13,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:43:13,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:43:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:43:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:43:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:43:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:43:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:43:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:43:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:43:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:43:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:43:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:43:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:43:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:43:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:43:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:43:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:43:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:43:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:43:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:43:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:43:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:43:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:43:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:43:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:43:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:43:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:43:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:43:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:43:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:43:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 22:43:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 22:43:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 22:43:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 22:43:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 22:43:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:13,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-08 22:43:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-08 22:43:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 22:43:14,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:43:14,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241462532] [2024-11-08 22:43:14,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241462532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:43:14,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:43:14,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:43:14,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883891024] [2024-11-08 22:43:14,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:43:14,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:43:14,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:43:14,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:43:14,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:43:14,011 INFO L87 Difference]: Start difference. First operand 176 states and 275 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:43:14,064 INFO L93 Difference]: Finished difference Result 281 states and 442 transitions. [2024-11-08 22:43:14,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:43:14,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 224 [2024-11-08 22:43:14,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:43:14,069 INFO L225 Difference]: With dead ends: 281 [2024-11-08 22:43:14,069 INFO L226 Difference]: Without dead ends: 177 [2024-11-08 22:43:14,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:43:14,071 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:43:14,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 322 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:43:14,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-08 22:43:14,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-08 22:43:14,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 22:43:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 276 transitions. [2024-11-08 22:43:14,103 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 276 transitions. Word has length 224 [2024-11-08 22:43:14,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:43:14,103 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 276 transitions. [2024-11-08 22:43:14,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 276 transitions. [2024-11-08 22:43:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-08 22:43:14,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:43:14,109 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:43:14,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 22:43:14,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:43:14,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:43:14,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1507947237, now seen corresponding path program 1 times [2024-11-08 22:43:14,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:43:14,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576784519] [2024-11-08 22:43:14,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:43:14,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:43:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:43:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:43:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:43:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:43:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:43:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:43:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:43:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:43:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:43:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:43:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:43:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:43:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:43:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:43:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:43:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:43:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:43:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:43:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:43:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:43:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:43:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:43:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:43:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:43:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:43:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:43:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:43:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:43:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 22:43:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 22:43:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 22:43:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 22:43:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 22:43:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-08 22:43:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-08 22:43:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 22:43:14,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:43:14,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576784519] [2024-11-08 22:43:14,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576784519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:43:14,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:43:14,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:43:14,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379683042] [2024-11-08 22:43:14,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:43:14,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:43:14,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:43:14,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:43:14,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:43:14,485 INFO L87 Difference]: Start difference. First operand 177 states and 276 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:43:14,558 INFO L93 Difference]: Finished difference Result 296 states and 465 transitions. [2024-11-08 22:43:14,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:43:14,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2024-11-08 22:43:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:43:14,564 INFO L225 Difference]: With dead ends: 296 [2024-11-08 22:43:14,564 INFO L226 Difference]: Without dead ends: 191 [2024-11-08 22:43:14,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:43:14,565 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 63 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:43:14,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 305 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:43:14,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-08 22:43:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 181. [2024-11-08 22:43:14,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 108 states have (on average 1.2962962962962963) internal successors, (140), 108 states have internal predecessors, (140), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 22:43:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 280 transitions. [2024-11-08 22:43:14,607 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 280 transitions. Word has length 225 [2024-11-08 22:43:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:43:14,609 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 280 transitions. [2024-11-08 22:43:14,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 280 transitions. [2024-11-08 22:43:14,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-08 22:43:14,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:43:14,614 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:43:14,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 22:43:14,615 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:43:14,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:43:14,615 INFO L85 PathProgramCache]: Analyzing trace with hash -180996505, now seen corresponding path program 1 times [2024-11-08 22:43:14,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:43:14,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764498175] [2024-11-08 22:43:14,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:43:14,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:43:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:43:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:43:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:43:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:43:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:43:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:43:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:43:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:43:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:43:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:43:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:43:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:43:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:43:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:43:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:43:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:43:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:43:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:43:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:43:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:43:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:43:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:43:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:43:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:43:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:43:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:43:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:43:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:43:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 22:43:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 22:43:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 22:43:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 22:43:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 22:43:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-08 22:43:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-08 22:43:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 22:43:15,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:43:15,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764498175] [2024-11-08 22:43:15,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764498175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:43:15,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:43:15,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:43:15,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013274628] [2024-11-08 22:43:15,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:43:15,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:43:15,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:43:15,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:43:15,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:43:15,203 INFO L87 Difference]: Start difference. First operand 181 states and 280 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:15,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:43:15,562 INFO L93 Difference]: Finished difference Result 402 states and 624 transitions. [2024-11-08 22:43:15,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:43:15,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2024-11-08 22:43:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:43:15,571 INFO L225 Difference]: With dead ends: 402 [2024-11-08 22:43:15,571 INFO L226 Difference]: Without dead ends: 297 [2024-11-08 22:43:15,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:43:15,574 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 143 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 22:43:15,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 578 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 22:43:15,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-08 22:43:15,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 280. [2024-11-08 22:43:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 171 states have (on average 1.327485380116959) internal successors, (227), 171 states have internal predecessors, (227), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-08 22:43:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 437 transitions. [2024-11-08 22:43:15,616 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 437 transitions. Word has length 225 [2024-11-08 22:43:15,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:43:15,619 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 437 transitions. [2024-11-08 22:43:15,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 437 transitions. [2024-11-08 22:43:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-08 22:43:15,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:43:15,622 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:43:15,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 22:43:15,623 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:43:15,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:43:15,624 INFO L85 PathProgramCache]: Analyzing trace with hash 11834047, now seen corresponding path program 1 times [2024-11-08 22:43:15,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:43:15,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179630858] [2024-11-08 22:43:15,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:43:15,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:43:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:43:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:43:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:43:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:43:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:43:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:43:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:43:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:43:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:43:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:43:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:43:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:43:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:43:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:43:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:43:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:15,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:43:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:43:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:43:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:43:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:43:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:43:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:43:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:43:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:43:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:43:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:43:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:43:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:43:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 22:43:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 22:43:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 22:43:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 22:43:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 22:43:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-08 22:43:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-08 22:43:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 22:43:16,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:43:16,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179630858] [2024-11-08 22:43:16,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179630858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:43:16,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:43:16,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:43:16,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888152046] [2024-11-08 22:43:16,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:43:16,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:43:16,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:43:16,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:43:16,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:43:16,138 INFO L87 Difference]: Start difference. First operand 280 states and 437 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:16,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:43:16,239 INFO L93 Difference]: Finished difference Result 495 states and 775 transitions. [2024-11-08 22:43:16,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:43:16,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 226 [2024-11-08 22:43:16,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:43:16,244 INFO L225 Difference]: With dead ends: 495 [2024-11-08 22:43:16,244 INFO L226 Difference]: Without dead ends: 285 [2024-11-08 22:43:16,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:43:16,247 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 56 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:43:16,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 292 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:43:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-08 22:43:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 279. [2024-11-08 22:43:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 170 states have (on average 1.3235294117647058) internal successors, (225), 170 states have internal predecessors, (225), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-08 22:43:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 435 transitions. [2024-11-08 22:43:16,294 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 435 transitions. Word has length 226 [2024-11-08 22:43:16,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:43:16,295 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 435 transitions. [2024-11-08 22:43:16,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:16,296 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 435 transitions. [2024-11-08 22:43:16,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 22:43:16,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:43:16,298 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:43:16,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 22:43:16,299 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:43:16,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:43:16,299 INFO L85 PathProgramCache]: Analyzing trace with hash -311021468, now seen corresponding path program 1 times [2024-11-08 22:43:16,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:43:16,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762058962] [2024-11-08 22:43:16,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:43:16,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:43:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:43:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:43:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:43:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:43:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:43:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:43:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:43:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:43:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:43:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:43:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:43:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:43:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:43:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:43:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:43:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:43:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:43:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:43:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:43:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:43:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:43:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:43:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:43:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:43:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:43:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:43:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:43:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:43:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 22:43:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 22:43:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 22:43:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 22:43:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 22:43:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-08 22:43:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-08 22:43:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 22:43:16,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:43:16,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762058962] [2024-11-08 22:43:16,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762058962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:43:16,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:43:16,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:43:16,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070924224] [2024-11-08 22:43:16,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:43:16,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:43:16,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:43:16,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:43:16,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:43:16,600 INFO L87 Difference]: Start difference. First operand 279 states and 435 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:43:16,815 INFO L93 Difference]: Finished difference Result 502 states and 786 transitions. [2024-11-08 22:43:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:43:16,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 228 [2024-11-08 22:43:16,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:43:16,819 INFO L225 Difference]: With dead ends: 502 [2024-11-08 22:43:16,819 INFO L226 Difference]: Without dead ends: 293 [2024-11-08 22:43:16,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:43:16,821 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 65 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:43:16,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 384 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:43:16,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-08 22:43:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 279. [2024-11-08 22:43:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 170 states have (on average 1.3176470588235294) internal successors, (224), 170 states have internal predecessors, (224), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-08 22:43:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 434 transitions. [2024-11-08 22:43:16,856 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 434 transitions. Word has length 228 [2024-11-08 22:43:16,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:43:16,857 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 434 transitions. [2024-11-08 22:43:16,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:16,857 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 434 transitions. [2024-11-08 22:43:16,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 22:43:16,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:43:16,860 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:43:16,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 22:43:16,860 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:43:16,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:43:16,861 INFO L85 PathProgramCache]: Analyzing trace with hash -445034974, now seen corresponding path program 1 times [2024-11-08 22:43:16,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:43:16,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505964993] [2024-11-08 22:43:16,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:43:16,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:43:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:43:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:43:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:43:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:43:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:43:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:43:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:43:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:43:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:43:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:43:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:43:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:43:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:43:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:43:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:43:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:43:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:43:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:43:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:43:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:43:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:43:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:17,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:43:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:18,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:43:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:18,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:43:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:18,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:43:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:18,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:43:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:18,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:43:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:18,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:43:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 22:43:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:18,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 22:43:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:18,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 22:43:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:18,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 22:43:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:18,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 22:43:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:18,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-08 22:43:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:18,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-08 22:43:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 22:43:18,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:43:18,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505964993] [2024-11-08 22:43:18,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505964993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:43:18,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:43:18,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 22:43:18,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111380062] [2024-11-08 22:43:18,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:43:18,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 22:43:18,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:43:18,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 22:43:18,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 22:43:18,120 INFO L87 Difference]: Start difference. First operand 279 states and 434 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:18,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:43:18,663 INFO L93 Difference]: Finished difference Result 525 states and 815 transitions. [2024-11-08 22:43:18,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:43:18,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 228 [2024-11-08 22:43:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:43:18,667 INFO L225 Difference]: With dead ends: 525 [2024-11-08 22:43:18,667 INFO L226 Difference]: Without dead ends: 320 [2024-11-08 22:43:18,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 22:43:18,668 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 96 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 22:43:18,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 526 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 22:43:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-08 22:43:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 302. [2024-11-08 22:43:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 193 states have (on average 1.3316062176165804) internal successors, (257), 193 states have internal predecessors, (257), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-08 22:43:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 467 transitions. [2024-11-08 22:43:18,711 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 467 transitions. Word has length 228 [2024-11-08 22:43:18,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:43:18,711 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 467 transitions. [2024-11-08 22:43:18,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:18,712 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 467 transitions. [2024-11-08 22:43:18,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-08 22:43:18,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:43:18,714 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:43:18,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 22:43:18,715 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:43:18,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:43:18,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1269667965, now seen corresponding path program 1 times [2024-11-08 22:43:18,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:43:18,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133535891] [2024-11-08 22:43:18,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:43:18,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:43:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:43:18,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474338464] [2024-11-08 22:43:18,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:43:18,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:43:18,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:43:18,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:43:18,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 22:43:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:43:19,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:43:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:43:19,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:43:19,278 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:43:19,279 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:43:19,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 22:43:19,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 22:43:19,489 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:43:19,651 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:43:19,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:43:19 BoogieIcfgContainer [2024-11-08 22:43:19,655 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:43:19,656 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:43:19,656 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:43:19,656 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:43:19,656 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:43:11" (3/4) ... [2024-11-08 22:43:19,660 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:43:19,661 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:43:19,662 INFO L158 Benchmark]: Toolchain (without parser) took 9970.35ms. Allocated memory was 142.6MB in the beginning and 295.7MB in the end (delta: 153.1MB). Free memory was 86.2MB in the beginning and 98.7MB in the end (delta: -12.6MB). Peak memory consumption was 142.2MB. Max. memory is 16.1GB. [2024-11-08 22:43:19,662 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 108.7MB in the end (delta: 243.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:43:19,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.72ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 67.6MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 22:43:19,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.13ms. Allocated memory is still 142.6MB. Free memory was 67.6MB in the beginning and 62.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:43:19,664 INFO L158 Benchmark]: Boogie Preprocessor took 89.12ms. Allocated memory is still 142.6MB. Free memory was 62.1MB in the beginning and 55.5MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 22:43:19,664 INFO L158 Benchmark]: RCFGBuilder took 830.88ms. Allocated memory was 142.6MB in the beginning and 203.4MB in the end (delta: 60.8MB). Free memory was 55.5MB in the beginning and 157.1MB in the end (delta: -101.6MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-11-08 22:43:19,665 INFO L158 Benchmark]: TraceAbstraction took 8540.95ms. Allocated memory was 203.4MB in the beginning and 295.7MB in the end (delta: 92.3MB). Free memory was 156.1MB in the beginning and 98.7MB in the end (delta: 57.3MB). Peak memory consumption was 149.6MB. Max. memory is 16.1GB. [2024-11-08 22:43:19,665 INFO L158 Benchmark]: Witness Printer took 5.56ms. Allocated memory is still 295.7MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:43:19,666 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.26ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 108.7MB in the end (delta: 243.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.72ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 67.6MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.13ms. Allocated memory is still 142.6MB. Free memory was 67.6MB in the beginning and 62.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.12ms. Allocated memory is still 142.6MB. Free memory was 62.1MB in the beginning and 55.5MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 830.88ms. Allocated memory was 142.6MB in the beginning and 203.4MB in the end (delta: 60.8MB). Free memory was 55.5MB in the beginning and 157.1MB in the end (delta: -101.6MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8540.95ms. Allocated memory was 203.4MB in the beginning and 295.7MB in the end (delta: 92.3MB). Free memory was 156.1MB in the beginning and 98.7MB in the end (delta: 57.3MB). Peak memory consumption was 149.6MB. Max. memory is 16.1GB. * Witness Printer took 5.56ms. Allocated memory is still 295.7MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 205, overapproximation of bitwiseOr at line 78, overapproximation of shiftRight at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 100; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] unsigned short int var_1_8 = 10; [L26] unsigned short int var_1_9 = 0; [L27] unsigned short int var_1_10 = 53946; [L28] unsigned short int var_1_11 = 1; [L29] unsigned long int var_1_12 = 8; [L30] double var_1_13 = 8.25; [L31] signed long int var_1_14 = -256; [L32] double var_1_15 = 0.19999999999999996; [L33] signed long int var_1_16 = -16; [L34] signed char var_1_17 = 1; [L35] signed char var_1_18 = 4; [L36] signed char var_1_19 = 64; [L37] signed long int var_1_20 = 1; [L38] signed long int var_1_21 = 1000000000; [L39] unsigned char var_1_23 = 4; [L40] unsigned char var_1_26 = 0; [L41] unsigned char var_1_27 = 5; [L42] unsigned short int var_1_28 = 16; [L43] unsigned short int var_1_29 = 200; [L44] signed short int var_1_30 = -256; [L45] signed short int var_1_32 = 8; [L46] unsigned short int var_1_33 = 128; [L47] double var_1_34 = 0.25; [L48] double var_1_35 = 5.75; [L49] signed long int var_1_36 = -32; [L50] unsigned char var_1_37 = 1; [L51] unsigned char var_1_38 = 0; [L52] unsigned char var_1_39 = 1; [L53] float var_1_40 = 2.6; [L54] unsigned char var_1_41 = 0; [L55] unsigned char var_1_42 = 0; [L56] unsigned short int last_1_var_1_1 = 100; [L57] unsigned long int last_1_var_1_12 = 8; [L58] double last_1_var_1_13 = 8.25; [L59] signed long int last_1_var_1_16 = -16; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L209] isInitial = 1 [L210] FCALL initially() [L211] COND TRUE 1 [L212] CALL updateLastVariables() [L199] last_1_var_1_1 = var_1_1 [L200] last_1_var_1_12 = var_1_12 [L201] last_1_var_1_13 = var_1_13 [L202] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L212] RET updateLastVariables() [L213] CALL updateVariables() [L144] var_1_6 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L145] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L146] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L146] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L147] var_1_7 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_8=10, var_1_9=0] [L148] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_8=10, var_1_9=0] [L149] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L149] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L150] var_1_8 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_9=0] [L151] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L152] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L153] var_1_9 = __VERIFIER_nondet_ushort() [L154] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767] [L154] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767] [L155] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L155] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L156] var_1_10 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L157] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L158] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L159] var_1_11 = __VERIFIER_nondet_ushort() [L160] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L160] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L161] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L161] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L162] var_1_14 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L163] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L164] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L164] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L165] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L165] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L166] var_1_15 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L167] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L168] var_1_18 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L169] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L170] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L170] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L171] var_1_19 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_19 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L172] RET assume_abort_if_not(var_1_19 >= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L173] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L173] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L174] var_1_21 = __VERIFIER_nondet_long() [L175] CALL assume_abort_if_not(var_1_21 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L175] RET assume_abort_if_not(var_1_21 >= 536870911) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L176] CALL assume_abort_if_not(var_1_21 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L176] RET assume_abort_if_not(var_1_21 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L177] var_1_26 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L178] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L179] CALL assume_abort_if_not(var_1_26 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L179] RET assume_abort_if_not(var_1_26 <= 64) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L180] var_1_27 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L181] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L182] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L182] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L183] var_1_29 = __VERIFIER_nondet_ushort() [L184] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L184] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L185] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L185] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L186] var_1_35 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L187] RET assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L188] var_1_37 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L189] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L190] CALL assume_abort_if_not(var_1_37 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L190] RET assume_abort_if_not(var_1_37 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L191] var_1_39 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_39 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L192] RET assume_abort_if_not(var_1_39 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L193] CALL assume_abort_if_not(var_1_39 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L193] RET assume_abort_if_not(var_1_39 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L194] var_1_42 = __VERIFIER_nondet_uchar() [L195] CALL assume_abort_if_not(var_1_42 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L195] RET assume_abort_if_not(var_1_42 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L196] CALL assume_abort_if_not(var_1_42 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L196] RET assume_abort_if_not(var_1_42 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L213] RET updateVariables() [L214] CALL step() [L63] COND TRUE (var_1_1 + var_1_12) > 16 [L64] var_1_23 = ((var_1_26 + 2) + var_1_27) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L72] var_1_28 = var_1_29 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L73] COND TRUE var_1_20 < 2 [L74] var_1_30 = (((((((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) > (var_1_20)) ? (((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) : (var_1_20))) + var_1_17) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L78] EXPR var_1_1 | var_1_20 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L78] COND FALSE !((~ (var_1_1 | var_1_20)) >= (~ (~ 32))) [L81] EXPR var_1_17 >> var_1_20 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L81] COND TRUE (var_1_17 >> var_1_20) <= var_1_17 [L82] COND FALSE !(var_1_16 > var_1_17) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L86] COND FALSE !(var_1_16 >= var_1_1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L91] COND TRUE ((var_1_20 - var_1_27) > var_1_16) && var_1_37 [L92] var_1_36 = ((((var_1_26) < (64)) ? (var_1_26) : (64))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=0, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L94] var_1_38 = var_1_39 [L95] var_1_40 = var_1_35 [L96] var_1_41 = var_1_42 [L97] unsigned char stepLocal_0 = last_1_var_1_13 >= last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_0=0, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L98] COND FALSE !((last_1_var_1_12 == last_1_var_1_1) && stepLocal_0) [L109] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L111] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L111] COND TRUE (((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16 [L112] COND TRUE \read(var_1_7) [L113] var_1_12 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L116] var_1_17 = (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1))))) [L117] unsigned long int stepLocal_4 = var_1_12; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L118] COND TRUE \read(var_1_6) [L119] var_1_20 = ((var_1_8 - (var_1_21 - var_1_11)) + var_1_10) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L127] unsigned char stepLocal_3 = var_1_6; [L128] unsigned char stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_2=1, stepLocal_3=1, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L129] COND FALSE !(stepLocal_2 && (var_1_9 < (var_1_10 + var_1_20))) [L134] var_1_16 = var_1_8 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=1, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=32767, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L136] signed long int stepLocal_1 = ((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14); VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_1=32767, stepLocal_3=1, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=32767, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L137] COND TRUE stepLocal_1 >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8))) [L138] var_1_13 = var_1_15 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=1, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=32767, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L214] RET step() [L215] CALL, EXPR property() [L205] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=32767, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L205] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=32767, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L205] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=32767, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L205-L206] return (((((((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1)) && (((((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14)) >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8)))) ? (var_1_13 == ((double) var_1_15)) : (var_1_13 == ((double) var_1_15)))) && ((var_1_6 && (var_1_9 < (var_1_10 + var_1_20))) ? ((var_1_7 && var_1_6) ? (var_1_16 == ((signed long int) var_1_10)) : 1) : (var_1_16 == ((signed long int) var_1_8)))) && (var_1_17 == ((signed char) (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1)))))))) && (var_1_6 ? (var_1_20 == ((signed long int) ((var_1_8 - (var_1_21 - var_1_11)) + var_1_10))) : (((~ var_1_19) == var_1_12) ? (var_1_20 == ((signed long int) var_1_1)) : (var_1_20 == ((signed long int) var_1_10)))) ; [L215] RET, EXPR property() [L215] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=32767, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=32767, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 10, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 581 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 581 mSDsluCounter, 3332 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1889 mSDsCounter, 217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 662 IncrementalHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 217 mSolverCounterUnsat, 1443 mSDtfsCounter, 662 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 708 GetRequests, 687 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=9, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 106 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 2485 NumberOfCodeBlocks, 2485 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2016 ConstructedInterpolants, 0 QuantifiedInterpolants, 6874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 21420/21420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 22:43:19,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-92.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 1647212ce4f3f4f9fd50f26c58789c1b74cae78fef7c8c598be9f288d0b5bbff --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:43:22,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:43:22,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:43:22,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:43:22,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:43:22,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:43:22,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:43:22,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:43:22,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:43:22,267 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:43:22,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:43:22,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:43:22,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:43:22,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:43:22,269 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:43:22,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:43:22,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:43:22,270 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:43:22,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:43:22,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:43:22,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:43:22,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:43:22,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:43:22,276 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:43:22,276 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:43:22,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:43:22,277 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:43:22,277 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:43:22,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:43:22,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:43:22,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:43:22,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:43:22,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:43:22,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:43:22,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:43:22,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:43:22,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:43:22,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:43:22,283 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:43:22,283 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:43:22,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:43:22,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:43:22,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:43:22,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:43:22,285 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 -> 1647212ce4f3f4f9fd50f26c58789c1b74cae78fef7c8c598be9f288d0b5bbff [2024-11-08 22:43:22,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:43:22,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:43:22,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:43:22,643 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:43:22,644 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:43:22,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i [2024-11-08 22:43:24,185 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:43:24,446 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:43:24,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i [2024-11-08 22:43:24,464 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36d363239/81daa486977f4803980c93d3827a0b6f/FLAG2c520ed0d [2024-11-08 22:43:24,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36d363239/81daa486977f4803980c93d3827a0b6f [2024-11-08 22:43:24,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:43:24,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:43:24,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:43:24,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:43:24,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:43:24,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:43:24" (1/1) ... [2024-11-08 22:43:24,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345a3a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:24, skipping insertion in model container [2024-11-08 22:43:24,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:43:24" (1/1) ... [2024-11-08 22:43:24,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:43:24,743 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-ps-co_file-92.i[919,932] [2024-11-08 22:43:24,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:43:24,855 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:43:24,869 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-ps-co_file-92.i[919,932] [2024-11-08 22:43:24,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:43:24,947 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:43:24,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:24 WrapperNode [2024-11-08 22:43:24,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:43:24,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:43:24,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:43:24,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:43:24,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:24" (1/1) ... [2024-11-08 22:43:24,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:24" (1/1) ... [2024-11-08 22:43:25,012 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2024-11-08 22:43:25,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:43:25,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:43:25,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:43:25,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:43:25,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:24" (1/1) ... [2024-11-08 22:43:25,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:24" (1/1) ... [2024-11-08 22:43:25,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:24" (1/1) ... [2024-11-08 22:43:25,062 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:43:25,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:24" (1/1) ... [2024-11-08 22:43:25,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:24" (1/1) ... [2024-11-08 22:43:25,076 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:24" (1/1) ... [2024-11-08 22:43:25,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:24" (1/1) ... [2024-11-08 22:43:25,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:24" (1/1) ... [2024-11-08 22:43:25,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:24" (1/1) ... [2024-11-08 22:43:25,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:43:25,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:43:25,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:43:25,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:43:25,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:24" (1/1) ... [2024-11-08 22:43:25,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:43:25,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:43:25,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:43:25,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:43:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:43:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:43:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:43:25,173 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:43:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:43:25,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:43:25,277 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:43:25,282 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:43:25,911 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 22:43:25,912 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:43:25,927 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:43:25,927 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:43:25,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:43:25 BoogieIcfgContainer [2024-11-08 22:43:25,928 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:43:25,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:43:25,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:43:25,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:43:25,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:43:24" (1/3) ... [2024-11-08 22:43:25,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5587468c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:43:25, skipping insertion in model container [2024-11-08 22:43:25,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:43:24" (2/3) ... [2024-11-08 22:43:25,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5587468c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:43:25, skipping insertion in model container [2024-11-08 22:43:25,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:43:25" (3/3) ... [2024-11-08 22:43:25,935 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i [2024-11-08 22:43:25,949 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:43:25,949 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:43:26,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:43:26,016 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;@3cf01c9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:43:26,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:43:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-08 22:43:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 22:43:26,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:43:26,037 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:43:26,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:43:26,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:43:26,042 INFO L85 PathProgramCache]: Analyzing trace with hash 853852761, now seen corresponding path program 1 times [2024-11-08 22:43:26,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:43:26,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142315683] [2024-11-08 22:43:26,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:43:26,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:43:26,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:43:26,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:43:26,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 22:43:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:26,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:43:26,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:43:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 1556 trivial. 0 not checked. [2024-11-08 22:43:26,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:43:26,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:43:26,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142315683] [2024-11-08 22:43:26,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142315683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:43:26,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:43:26,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:43:26,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947036594] [2024-11-08 22:43:26,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:43:26,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:43:26,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:43:26,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:43:26,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:43:26,548 INFO L87 Difference]: Start difference. First operand has 96 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-08 22:43:26,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:43:26,594 INFO L93 Difference]: Finished difference Result 185 states and 333 transitions. [2024-11-08 22:43:26,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:43:26,596 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 218 [2024-11-08 22:43:26,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:43:26,604 INFO L225 Difference]: With dead ends: 185 [2024-11-08 22:43:26,605 INFO L226 Difference]: Without dead ends: 92 [2024-11-08 22:43:26,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:43:26,613 INFO L432 NwaCegarLoop]: 145 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, 145 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:43:26,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:43:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-08 22:43:26,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-08 22:43:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-08 22:43:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 145 transitions. [2024-11-08 22:43:26,669 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 145 transitions. Word has length 218 [2024-11-08 22:43:26,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:43:26,670 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 145 transitions. [2024-11-08 22:43:26,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-08 22:43:26,671 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 145 transitions. [2024-11-08 22:43:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 22:43:26,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:43:26,680 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:43:26,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 22:43:26,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:43:26,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:43:26,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:43:26,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1076756385, now seen corresponding path program 1 times [2024-11-08 22:43:26,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:43:26,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561233917] [2024-11-08 22:43:26,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:43:26,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:43:26,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:43:26,886 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:43:26,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 22:43:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:27,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 22:43:27,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:43:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 22:43:27,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:43:27,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:43:27,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561233917] [2024-11-08 22:43:27,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561233917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:43:27,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:43:27,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:43:27,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023775663] [2024-11-08 22:43:27,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:43:27,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:43:27,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:43:27,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:43:27,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:43:27,848 INFO L87 Difference]: Start difference. First operand 92 states and 145 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:27,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:43:27,941 INFO L93 Difference]: Finished difference Result 259 states and 415 transitions. [2024-11-08 22:43:27,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:43:27,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 218 [2024-11-08 22:43:27,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:43:27,946 INFO L225 Difference]: With dead ends: 259 [2024-11-08 22:43:27,946 INFO L226 Difference]: Without dead ends: 170 [2024-11-08 22:43:27,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:43:27,949 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 27 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:43:27,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 267 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:43:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-08 22:43:27,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 156. [2024-11-08 22:43:27,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 83 states have internal predecessors, (105), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 22:43:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 245 transitions. [2024-11-08 22:43:27,980 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 245 transitions. Word has length 218 [2024-11-08 22:43:27,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:43:27,981 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 245 transitions. [2024-11-08 22:43:27,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:27,982 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 245 transitions. [2024-11-08 22:43:27,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 22:43:27,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:43:27,988 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:43:27,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 22:43:28,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:43:28,189 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:43:28,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:43:28,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1629863009, now seen corresponding path program 1 times [2024-11-08 22:43:28,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:43:28,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042793536] [2024-11-08 22:43:28,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:43:28,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:43:28,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:43:28,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:43:28,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 22:43:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:28,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 22:43:28,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:43:29,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 22:43:29,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:43:29,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:43:29,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042793536] [2024-11-08 22:43:29,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042793536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:43:29,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:43:29,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:43:29,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84408939] [2024-11-08 22:43:29,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:43:29,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:43:29,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:43:29,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:43:29,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:43:29,581 INFO L87 Difference]: Start difference. First operand 156 states and 245 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:29,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:43:29,686 INFO L93 Difference]: Finished difference Result 257 states and 409 transitions. [2024-11-08 22:43:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:43:29,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 218 [2024-11-08 22:43:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:43:29,690 INFO L225 Difference]: With dead ends: 257 [2024-11-08 22:43:29,694 INFO L226 Difference]: Without dead ends: 168 [2024-11-08 22:43:29,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:43:29,696 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 23 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:43:29,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 263 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:43:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-08 22:43:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 157. [2024-11-08 22:43:29,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 84 states have internal predecessors, (106), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 22:43:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 246 transitions. [2024-11-08 22:43:29,734 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 246 transitions. Word has length 218 [2024-11-08 22:43:29,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:43:29,735 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 246 transitions. [2024-11-08 22:43:29,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:29,735 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 246 transitions. [2024-11-08 22:43:29,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-08 22:43:29,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:43:29,738 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:43:29,750 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 (4)] Forceful destruction successful, exit code 0 [2024-11-08 22:43:29,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:43:29,939 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:43:29,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:43:29,940 INFO L85 PathProgramCache]: Analyzing trace with hash -20429306, now seen corresponding path program 1 times [2024-11-08 22:43:29,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:43:29,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406146818] [2024-11-08 22:43:29,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:43:29,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:43:29,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:43:29,946 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:43:29,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 22:43:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:30,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 22:43:30,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:43:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 22:43:31,250 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:43:31,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:43:31,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406146818] [2024-11-08 22:43:31,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406146818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:43:31,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:43:31,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:43:31,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918170713] [2024-11-08 22:43:31,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:43:31,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:43:31,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:43:31,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:43:31,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:43:31,256 INFO L87 Difference]: Start difference. First operand 157 states and 246 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:31,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:43:31,403 INFO L93 Difference]: Finished difference Result 256 states and 406 transitions. [2024-11-08 22:43:31,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:43:31,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 219 [2024-11-08 22:43:31,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:43:31,409 INFO L225 Difference]: With dead ends: 256 [2024-11-08 22:43:31,412 INFO L226 Difference]: Without dead ends: 167 [2024-11-08 22:43:31,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:43:31,414 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 18 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:43:31,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 264 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:43:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-08 22:43:31,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2024-11-08 22:43:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 86 states have (on average 1.255813953488372) internal successors, (108), 86 states have internal predecessors, (108), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 22:43:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 248 transitions. [2024-11-08 22:43:31,442 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 248 transitions. Word has length 219 [2024-11-08 22:43:31,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:43:31,443 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 248 transitions. [2024-11-08 22:43:31,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 248 transitions. [2024-11-08 22:43:31,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-08 22:43:31,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:43:31,449 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:43:31,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 22:43:31,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:43:31,651 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:43:31,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:43:31,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1041497660, now seen corresponding path program 1 times [2024-11-08 22:43:31,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:43:31,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681479222] [2024-11-08 22:43:31,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:43:31,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:43:31,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:43:31,656 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:43:31,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 22:43:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:31,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 22:43:31,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:43:32,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 22:43:32,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:43:32,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:43:32,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681479222] [2024-11-08 22:43:32,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681479222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:43:32,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:43:32,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:43:32,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51089292] [2024-11-08 22:43:32,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:43:32,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:43:32,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:43:32,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:43:32,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:43:32,347 INFO L87 Difference]: Start difference. First operand 159 states and 248 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:32,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:43:32,667 INFO L93 Difference]: Finished difference Result 345 states and 540 transitions. [2024-11-08 22:43:32,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:43:32,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 219 [2024-11-08 22:43:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:43:32,671 INFO L225 Difference]: With dead ends: 345 [2024-11-08 22:43:32,671 INFO L226 Difference]: Without dead ends: 256 [2024-11-08 22:43:32,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:43:32,673 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 103 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 22:43:32,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 415 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 22:43:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-08 22:43:32,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 244. [2024-11-08 22:43:32,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 135 states have (on average 1.288888888888889) internal successors, (174), 135 states have internal predecessors, (174), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-08 22:43:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 384 transitions. [2024-11-08 22:43:32,726 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 384 transitions. Word has length 219 [2024-11-08 22:43:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:43:32,729 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 384 transitions. [2024-11-08 22:43:32,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 22:43:32,730 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 384 transitions. [2024-11-08 22:43:32,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-08 22:43:32,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:43:32,735 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:43:32,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-08 22:43:32,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:43:32,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:43:32,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:43:32,937 INFO L85 PathProgramCache]: Analyzing trace with hash 850439842, now seen corresponding path program 1 times [2024-11-08 22:43:32,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:43:32,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179505412] [2024-11-08 22:43:32,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:43:32,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:43:32,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:43:32,941 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:43:32,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 22:43:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:43:33,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 22:43:33,313 INFO L278 TraceCheckSpWp]: Computing forward predicates...